[LeetCode 解题报告]128. Longest Consecutive Sequence

最新推荐文章于 2022-07-02 13:46:24 发布

caicaiatnbu

最新推荐文章于 2022-07-02 13:46:24 发布

阅读量137

点赞数

分类专栏： LeetCode 解题报告

本文链接：https://blog.csdn.net/caicaiatnbu/article/details/103746054

版权

LeetCode 解题报告专栏收录该内容

154 篇文章 5 订阅

订阅专栏

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

Your algorithm should run in O(n) complexity.

Example:

Input: [100, 4, 200, 1, 3, 2]
Output: 4
Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4。

class Solution {
public:
    int longestConsecutive(vector<int>& nums) {
        if (nums.empty())
            return 0;
        
        int res = 0;
        unordered_set<int> s(nums.begin(), nums.end());
        for (int i = 0; i < nums.size(); i ++) {
            if (!s.count(nums[i])) //已经被删除
                continue;
            s.erase(nums[i]);
            int pre = nums[i] - 1, next = nums[i] + 1;
            while(s.count(pre))
                s.erase(pre--); //删除连续的前一个
            while(s.count(next))
                s.erase(next++); //删除连续的后一个
            res = max(res, next - pre -1);
        }
        return res;
    }
};