题目描述
https://leetcode-cn.com/problems/longest-consecutive-sequence/
要求:时间复杂度O(N)
思路题解
https://leetcode-cn.com/problems/longest-consecutive-sequence/solution/zui-chang-lian-xu-xu-lie-by-leetcode-solution/
只看有没有比他小的数,有的话证明不是开头,跳过
class Solution:
def longestConsecutive(self, nums: List[int]) -> int:
#只看有没有比他小的数,有的话证明不是开头,跳过
ans=0
m={}
for i in nums:
m[i]=1
for i in m:
sum=1
if i-1 not in m:
while i+1 in m:
sum+=1
i+=1
ans=max(sum,ans)
return ans