leetcode 128. Longest Consecutive Sequence

最新推荐文章于 2024-11-09 23:37:51 发布

景行cmy

最新推荐文章于 2024-11-09 23:37:51 发布

阅读量109

点赞数

分类专栏： leetcode 数组文章标签： leetcode 数组

本文链接：https://blog.csdn.net/cmy203/article/details/95959212

版权

leetcode 同时被 2 个专栏收录

155 篇文章 0 订阅

订阅专栏

数组

4 篇文章 0 订阅

订阅专栏

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.

解题思路：

将向量中的元素存储在set中，将元素有序存放。然后再遍历set中元素。

class Solution {
public:
    int longestConsecutive(vector<int>& nums) 
    {
        if(nums.empty()) return 0 ;
        
        set<int> num ;
        int sz = nums.size() ;
        int ans = 1 ;
        
        for(int i = 0 ; i < sz ; i++)
        {
            num.insert(nums[i]) ;
        }
        
        auto itb = num.begin() ;
        
        while(itb != num.end())
        {
            int cnt = 1 ;
            auto its = itb ;
            its++ ;
            while(its != num.end() && *its == *itb + 1) //寻找有序序列
            {
                itb++ ;
                its++ ;
                cnt++ ;
            }
            
            ans = max(ans , cnt) ;
            
            itb++ ;
        }
        
        return ans ;
    }
};