Leetcode128.『最长连续序列』学习笔记

1. 使用set的简洁解法

class Solution:
def longestConsecutive(self, nums: List[int]) –> int:
nums = set(nums)
longest = 0
for num in nums:
if num – 1 not in nums:
curr = num
while num in nums:
num+=1
longest = max(longest, num – curr)
return longest

加了set之后，if num – 1 not in nums就变成了“哈希查找”