【leetcode】最长连续序列（unordered_map的使用）

128. Longest Consecutive Sequence

leetcode题目描述

题目描述：

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.

题解：

在无序序列中找到最长连续序列的长度。
1. 用一个哈希表unordered_map<int, bool>used 记录每个元素是否使用，对每个元素，以该元素为中心向左右扩张，知道找不到连续数扩张长度，记录最长的长度。
2. 连续序列可以用两端和长度来表示，unordered_map<int, int>map记录数值和所在连续长度。遇到连续元素把则将两序列连接，长度相加并更新map中端点对应的长度值。

solution1

class Solution {
public:
    int longestConsecutive(const 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;
            /* .find(key）函数返回一个迭代器指向键值为key的元素，
            如果没找到就返回指向map尾部的迭代器*/
            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;

    }
};

solution2

class Solution {
public:
    int longestConsecutive(const vector<int> &nums) {
        unordered_map<int, int>map;
        int length = 1;
        for (auto i:nums) {
            if (map.find(i) != map.end()) {
                continue;
            }
            map[i] = 1;
            if (map.find(i-1) != map.end()) {
                length = max(length, merge(map, i-1, i));
            }
            if (map.find(i+1) != map.end()) {
                length = max(length, merge(map, i, i+1));
            }

        }
        return nums.size() == 0 ? 0 : length;
    }
private:
    int merge(unordered_map<int, int>& map, int left, int right) { 
        int upper = right + map[right] - 1;
        int lower = left - map[left] + 1;
        int length = upper - lower + 1;
        map[upper] = length;
        map[lower] = length;
        return length;
    }
};