Method longestConsecutive

Array/LongestConsecutiveSequence.py:105–150

:type nums: List[int] :rtype: int

(self, nums)

class Solution(object):
    def longestConsecutive(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        numx = set(nums)
        
        maxes = 0
        
        for i in nums:
            if i-1 not in numx:
                x = i
                currentMaxes = 1
                while 1:
                    if x+1 in numx:
                        x += 1
                        currentMaxes += 1
                        continue
                    else:
                        maxes = max(maxes, currentMaxes)
                        break
        return maxes

        # sorted.
        # if not nums:
        #     return 0
        
        # nums.sort()
        
        # currentNums = nums[0]
        # result = []
        # currentMax = 1
        
        # for i in nums[1:]:
        #     if i == currentNums + 1:
        #         currentMax += 1
        #         currentNums = i
        #     elif i == currentNums:
        #         pass
        #     else:
        #         result.append(currentMax)
        #         currentMax = 1
        #         currentNums = i
        # result.append(currentMax)
        
        # return max(result)