1class Solution(object):2 def longestConsecutive(self, nums):3 ans = 04 nums = set(nums)5 count = 06 for i in nums:7 if i - 1 not in nums:8 j = i9 count = 010 while j in nums:11 count += 112 j += 113 ans = max(ans, count)14 return ans
WPM •0 •0
ACC •0 •0
TIME •0