Longest Consecutive Sequence LeetCode solution in Python

1
class Solution(object):
2
def longestConsecutive(self, nums):
3
ans = 0
4
nums = set(nums)
5
count = 0
6
for i in nums:
7
if i - 1 not in nums:
8
j = i
9
count = 0
10
while j in nums:
11
count += 1
12
j += 1
13
ans = max(ans, count)
14
return ans

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0