Given an unsorted array of integers nums
, return the length of the longest consecutive elements sequence.
You must write an algorithm that runs in O(n)
time.
Example 1:
Input: nums = [100,4,200,1,3,2]
Output: 4
Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]
. Therefore its length is 4.
Example 2:
Input: nums = [0,3,7,2,5,8,4,6,0,1] Output: 9
Constraints:
0 <= nums.length <= 105
-109 <= nums[i] <= 109
这道题有很多解法,比如通过排序或者使用Hashmap。但是通过分析题目就会发现这题还可以使用并查集(Union Find)来解答。
我们知道并查集(Union Find)是解决连通性问题和处理集合的合并与查找问题。题目要求是从一个未排序的数组中查找一个最长的连续数的序列,其实就是合并连续的数,然后查找最长连续数序列,刚好满足并查集特