LeetCode--128--最长连续序列(python)

class Solution:
    def longestConsecutive(self, nums: List[int]) -> int:
        longestSequence = 0
        for num in nums:
            curNum = num
            streak = 1
            
            while curNum +1 in nums:
                curNum += 1
                streak += 1
            longestSequence = max(longestSequence,streak)
        return longestSequence

 1 class Solution:
 2     def longestConsecutive(self, nums: List[int]) -> int:
 3         if not nums:
 4             return 0
 5         nums.sort()
 6         longestSequence = 1
 7         curStreak = 1
 8         for i in range(1,len(nums)):
 9             if nums[i] != nums[i-1]:
10                 if nums[i] == nums[i-1]+1:
11                     curStreak += 1
12                 else:
13                     longestSequence = max(longestSequence,curStreak)
14                     curStreak = 1
15         return max(longestSequence, curStreak)