*leetcode #128 in cpp

本文介绍了一种寻找未排序整数数组中最长连续元素序列的算法。通过使用映射存储数据,该算法能在O(n)的时间复杂度内找到最长连续序列的长度。示例中展示了一个具体的实现案例。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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.


Solution:

We store the number into a map. For each number, we try to find its right and its left as far as we can, by check if map contains number + 1 and number - 1. If we cannot find any left or right, this means the consecutive list containing the number has terminated

Code:

class Solution {
public:
    int longestConsecutive(vector<int>& nums) {
        map<int,int> mapp;
        for(int i =0; i < nums.size(); i ++){
            mapp[nums[i]] = 1; 
        }
        int max_len = 0;
        for(int i =0; i < nums.size(); i ++){
            int cur = nums[i];
            int curLen = 0; 
            while(mapp.find(cur)!=mapp.end()){
                mapp.erase(cur);
                cur--;
                curLen++; 
            }
            cur = nums[i] + 1;
            while(mapp.find(cur)!=mapp.end()){
                mapp.erase(cur);
                cur++;
                curLen++; 
            }
            max_len = max(max_len, curLen);
        }
        return max_len; 
        
        
    }
};



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值