2018年5月23日
323. Number of Connected Components in an Undirected Graph (leetcode)
摘要： Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to find the number of connected 阅读全文
posted @ 2018-05-23 13:25 wz30 阅读(146) 评论(0) 推荐(0)
Leetcode 128. Longest Consecutive Sequence (union find)
摘要： Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Your algorithm should run in O(n) complexity. Examp 阅读全文
posted @ 2018-05-23 12:32 wz30 阅读(604) 评论(0) 推荐(0)