每日一道Leetcode - 128. 最长连续序列

class Solution:
    def longestConsecutive(self, nums: List[int]) -> int:
        # 判断num-1是否在数组中，如果在的话就略过，不在的话，就可以从当前num开始了
        # O(n)
        res = 0
        num_set = set(nums)
        for num in nums:
            if num-1 not in num_set:
                cur_num = num
                cur_len = 1
                while cur_num+1 in num_set:
                    cur_num += 1
                    cur_len += 1
                res = max(res,cur_len)
        return res