给定一个未排序的整数数组 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
class Solution:
def longestConsecutive(self, nums: List[int]) -> int:
if len(nums) in (0, 1):
return len(nums)
counter = Counter(nums)
res = 0
for num in list(counter.keys()):
if not counter[num]:
continue
_res = 1
counter[num] = 0
# 往左找
tmp = num
while (tmp + 1) in counter and counter[tmp + 1]:
counter[tmp + 1] = 0
_res += 1
tmp += 1
# 往右找
tmp = num
while (tmp - 1) in counter and counter[tmp - 1]:
counter[tmp - 1] = 0
_res += 1
tmp -= 1
res = max(res, _res)
return res