from typing import List
classSolution:deflongestConsecutive(self, nums: List[int])->int:iflen(nums)==0:return0
nums.sort()
res =[]
count =1for right inrange(1,len(nums)):
left = right -1if nums[right]- nums[left]==0:# 判断是否相同,相同则跳过continueelif nums[right]- nums[left]==1:# 判断是否连续
res.append(nums[right])
count =max(len(res)+1, count)# 随时计算最大值else:
res =[]return count
if __name__ =="__main__":
s = Solution()# nums = [100,4,200,1,3,2]# nums = [1,2,0,1]
nums =[0]
a = s.longestConsecutive(nums)print(a)