[LeetCode]128. Longest Consecutive Sequence

128. Longest Consecutive Sequence

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>& nums) {
        map<int,bool> mapper; // 使用哈希表可以O(1)时间查找该数是否被访问过
        for(int i = 0; i < nums.size(); ++i) {
            mapper[nums[i]] = false;
        }

        int longest = 0;

        for(int i = 0; i < nums.size(); ++i) {
            if(mapper[nums[i]]) continue;//访问过则不继续检查

            int innerLongest = 1;
            //向两边的连续数做检查
            for(int right = nums[i] + 1; mapper.find(right) != mapper.end(); ++right) {
                if(mapper[right] == false) {
                    mapper[right] = true;
                    innerLongest += 1;
                }
            }

            for(int left = nums[i] - 1; mapper.find(left) != mapper.end(); --left) {
                if(mapper[left] == false) {
                    mapper[left] = true;
                    innerLongest += 1;
                }
            }

            longest = longest > innerLongest ? longest : innerLongest;
        }

        return longest;
    }
};