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 |
반응형
'python-algorithm' 카테고리의 다른 글
백준 25305 커트라인 (0) | 2022.07.07 |
---|---|
leetcode 2236. Root Equals Sum of Children (0) | 2022.07.07 |
leetcode 509. Fibonacci Number (0) | 2022.07.06 |
leetcode 462. Minimum Moves to Equal Array Elements II (0) | 2022.06.30 |
백준 2756 다트 (0) | 2022.06.17 |
댓글