本文共 828 字，大约阅读时间需要 2 分钟。

题目

基本思路

使用一个哈希表（在Python中是字典dict数据类型）。

实现代码

class Solution:    def longestConsecutive(self, nums):        """        :type nums: List[int]        :rtype: int        """        dic = {
    num: False for num in nums}        maxLen = 0        for i in dic:            if dic[i] == False:                cur,rightLen = i+1,0                while cur in dic:                    dic[cur] = True                    rightLen += 1                    cur += 1                cur,leftLen = i-1,0                while cur in dic:                    dic[cur] = True                    leftLen += 1                    cur -= 1                maxLen = max(maxLen,leftLen+1+rightLen)        return maxLen