longest-consecutive-sequence leetcode C++

最新推荐文章于 2021-07-08 10:11:33 发布

DarrenXf

最新推荐文章于 2021-07-08 10:11:33 发布

阅读量186

点赞数

分类专栏： Algorithm 牛客网 C++ 算法 leetcode 文章标签： C leetcode 牛客网算法

本文链接：https://blog.csdn.net/DarrenXf/article/details/82768367

版权

算法同时被 3 个专栏收录

149 篇文章 0 订阅

订阅专栏

Algorithm

147 篇文章 0 订阅

订阅专栏

牛客网

146 篇文章 0 订阅

订阅专栏

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.

C++

class Solution {
public:
    int longestConsecutive(vector<int>& nums) {
        int len = nums.size();
        unordered_set<int> se;
        for(int i=0;i<len;i++)
            se.insert(nums[i]);
        int maxLen = 0;
        for(int i=0;i<len;i++){
            int tmpLen = 1;
            for(int tmp = nums[i] + 1;se.count(tmp);tmpLen++,tmp++)
                se.erase(tmp);
            for(int tmp = nums[i] - 1;se.count(tmp);tmpLen++,tmp--)
                se.erase(tmp);
            maxLen = max(tmpLen, maxLen);
        }
        return maxLen;
    }
};