[LeetCode] Longest Consecutive Sequence

[Problem]

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.

[Analysis]
利用map存储数组中的数，key表示数本身，value表示以该数为结尾达到的最大连续长度。
例如，给定[100, 4, 200, 1, 3, 2]，遍历一遍数组，初始化key和value=1得到map的存储结果为(注意，map已经按key排好序了)：
[<1, 1>, <2, 1>, <3, 1>, <4, 1>, <100, 1>, <200,1>]
对map进行一次遍历，更新每个value，得到如下结果：
[<1, 1>, <2, 2>, <3, 3>, <4, 4>, <100, 1>, <200,1>]
返回最大的value=4.

[Solution]

class Solution {
public:
    int longestConsecutive(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        map<int, int> data;
        for(int i = 0; i < num.size(); ++i){
            data[num[i]] = 1;
        }
        int max = 1;
        int pre_k = 0;
        int pre_v = 0;
        map<int, int>::iterator it;
        for(it = data.begin(); it != data.end(); ++it){
            if(it == data.begin()){
                pre_k = it->first;
                pre_v = it->second;
                continue;
            }
            if(it->first == pre_k + 1){
                it->second = pre_v + 1;
                max = max > it->second ? max : it->second;
            }
            pre_k = it->first;
            pre_v = it->second;
        }
        return max;
    }
};

说明：版权所有，转载请注明出处。 Coder007的博客