【LeetCode】Longest Consecutive Sequence

最新推荐文章于 2019-05-08 22:05:03 发布

Snowwolf_Yang

最新推荐文章于 2019-05-08 22:05:03 发布

阅读量461

点赞数

分类专栏： LeetCode 最值问题

本文链接：https://blog.csdn.net/snowwolf_yang/article/details/32322219

版权

LeetCode 同时被 2 个专栏收录

86 篇文章 0 订阅

订阅专栏

最值问题

6 篇文章 0 订阅

订阅专栏

参考链接

题目描述

Longest Consecutive Sequence

Total Accepted: 12727 Total Submissions: 46653 My Submissions

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.

题目分析

总结

代码示例

class Solution {
public:
    int longestConsecutive(vector<int> &num) {
        set<int> num_set;
        for (int i = 0; i < num.size(); i++) {
            num_set.insert(num[i]);
        }
        int max_len = 0;
        for (int i = 0; i < num.size(); i++) {
            if (num_set.find(num[i]) == num_set.end())
                continue;
            int tmp_len = 1, tmp = num[i];
            num_set.erase(num[i]);
            while (num_set.find(--tmp) != num_set.end()) {
                tmp_len++;
                num_set.erase(tmp);
            }
            tmp = num[i];
            while (num_set.find(++tmp) != num_set.end()) {
                tmp_len++;
                num_set.erase(tmp);
            }
            max_len = max(max_len, tmp_len);
        }
        return max_len;
    }
};

class Solution {
public:
    int longestConsecutive(vector<int> &num) {
        map<int,int> mp;
        int maxlen = 0;
        for(int i = 0;i<num.size();i++)
            mp[num[i]] = 1;
        for(int i = 0;i<num.size();i++)mp 下标是什么要搞明白 
        {
            if(!mp[num[i]]) continue;
            int tmplen = 1;
            int tmp = num[i]-1;
            while(mp[tmp])
            {
                mp.erase(tmp--);
                tmplen++;
            }
            tmp = num[i]+1;
            while(mp[tmp])
            {
                mp.erase(tmp++);
                tmplen++;
            }
            if(tmplen > maxlen) maxlen = tmplen;
        }
        return maxlen;
    }
};