给定一个未排序的整数数组 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 <= 104
-109 <= nums[i] <= 109
#最直观的思路
#两种方法,第二种方法是进阶思路,O(n)时间复杂度
class Solution:
def longestConsecutive(self, nums: List[int]) -> int:
# if len(nums) <= 1:
# return len(nums)
# nums = sorted(nums)
# pre = nums[0]
# res = 1
# ans = 1
# for i in range(1, len(nums)):
# if nums[i] == pre:
# continue
# if nums[i] == (pre + 1):
# res += 1
# else:
# res = 1
# ans = max(ans, res)
# pre = nums[i]
# return ans
val = {}
res = 0
for i in range(len(nums)):
num = nums[i]
if num not in val:
val[num] = 1
l = val.get(num-1, 0)
r = val.get(num+1, 0)
length = l + r + 1
res = max(res, length)
val[num - l] = length
val[num + r] = length
return res