LeetCode128 最长连续序列

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

Your algorithm should run in O(n) complexity.

Example:

Input: [100, 4, 200, 1, 3, 2]
Output: 4
Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.

public int longestConsecutive(int[] num) {
    int res = 0;
    HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
    for (int n : num) {
        if (!map.containsKey(n)) {
            int left = (map.containsKey(n - 1)) ? map.get(n - 1) : 0;
            int right = (map.containsKey(n + 1)) ? map.get(n + 1) : 0;
            int sum = left + right + 1;
            map.put(n, sum);
            res = Math.max(res, sum);
            
            // 将连续序列两端处的长度值更新
            // 如果没有邻居则等于什么都不用做
            map.put(n - left, sum);
            map.put(n + right, sum);
        }
        else {
            continue;
        }
    }
    return res;
    }