leetcode128. Longest Consecutive Sequence

hard程度题

题目:

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.

一个无序整数数组，找出其中最长的连续元素序列，返回其长度。复杂度要求为O（n）

不会做，参考的网上的解法，学到了新数据类型unordered_map

用一个哈希表记录每个元素是否使用，用bool来标识，对每个元素往左右扩张，直到不连续为止

AC解法:

class Solution {
public:
    int longestConsecutive(vector<int>& nums) 
    {
        unordered_map<int ,bool> used;
        for (auto i : nums)
            used[i] = false;
        
        int longest = 0;
        
        for (auto i : nums)
        {
            if (used[i])
                continue;
            int length = 1;
            used[i] = true;
            
            for (int j = i + 1; used.find(j) != used.end(); j++)
            {
                used[j] = true;
                length++;
            }
            
            for (int j = i - 1; used.find(j) != used.end(); j--)
            {
                used[j] = true;
                length++;
            }
            
            longest = max(longest,length);
        }
        
        return longest;
    }
};