python-leetcode面试题解之第128题最长连续序列-题解.zip

class Solution(object): def longestConsecutive(self, nums): """ :type nums: List[int] :rtype: int """ def longestConsecutive(self, num): # Pop adjacency O(n) and O(n) num = set(num) maxLen = 0 while num: n = num.pop() i = n + 1 l1 = 0 l2 = 0 while i in num: num.remove(i) i += 1 l1 += 1 i = n - 1 while i in num: num.remove(i) i -= 1 l2 += 1 maxLen = max(maxLen, l1 + l2 + 1) return maxLen