1. 使用set的简洁解法classSolution:deflongestConsecutive(self,nums:List[int])-int:numsset(nums)longest0fornuminnums:ifnum-1notinnums:currnumwhilenuminnums:num1longestmax(longest,num-curr)returnlongest加了set之后if num - 1 not in nums就变成了“哈希查找”