python-algorithm
leetcode 128. Longest Consecutive Sequence
무적김두칠
2022. 7. 6. 16:33
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
class Solution:
def longestConsecutive(self, nums: List[int]) -> int:
nums=list(set(nums))
nums.sort()
ans=1
start=1
for i in range(1,len(nums)):
if nums[i]-1 == nums[i-1] :
start+=1
else :
ans=max(ans,start)
start=1
ans=max(ans,start)
if len(nums) ==0 :
ans=0
return ans
|
cs |
반응형