给定一个未排序的整数数组 nums ,找出数字连续的最长序列(不要求序列元素在原数组中连续)的长度。
请你设计并实现时间复杂度为 O(n) 的算法解决此问题。
示例 1:
输入:nums = [100,4,200,1,3,2]
输出:4
解释:最长数字连续序列是 [1, 2, 3, 4]。它的长度为 4。
示例 2:
输入:nums = [0,3,7,2,5,8,4,6,0,1]
输出:9
提示:
0 <= nums.length <= 105
-109 <= nums[i] <= 109
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/longest-consecutive-sequence
class Solution {
public int longestConsecutive(int[] nums) {
Set<Integer> numsSet = new HashSet<>();
for (int num : nums) {
numsSet.add(num);
}
int longest = 0;
for(int num:nums)
{
int length = 1;
if (numsSet.contains(num))
{
numsSet.remove(num);
int left = num-1;
int right = num+1;
while(numsSet.contains(left))
{
numsSet.remove(left);
left--;
length++;
}
while(numsSet.contains(right))
{
numsSet.remove(right);
right++;
length++;
}
longest = Math.max(length, longest);
}
}
return longest;
}
}