Longest Consecutive Sequence

最新推荐文章于 2025-10-28 13:37:37 发布

原创最新推荐文章于 2025-10-28 13:37:37 发布 · 289 阅读

0 ·

CC 4.0 BY-SA版权

python 同时被 3 个专栏收录

20 篇文章

订阅专栏

Leetcode

12 篇文章

订阅专栏

union-find

3 篇文章

订阅专栏

本文介绍了一种寻找未排序整数数组中最长连续元素序列长度的算法。通过使用集合(set)来提高查找效率，确保了算法能在O(n)的时间复杂度内运行。示例中给出了具体实现方法。

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

For example,
Given [100, 4, 200, 1, 3, 2],
The longest consecutive elements sequence is [1, 2, 3, 4]. Return its length: 4.

Your algorithm should run in O(n) complexity.

这道题其实并没有太多思路，看到好的解法中用了set。判断值是否在set集合中的速度明显要比list快的多, 因为查找set用到了hash，时间在O(1)级别。

class Solution(object):
    def longestConsecutive(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        length = 0
        nums = set(nums)

        for x in nums:
            if x-1 not in nums:
                y = x+1
                while y in nums:
                    y = y + 1
                length = max(length, y-x)
        return length