LeetCode - Longest Consecutive Sequence

https://leetcode.com/problems/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.

这道题难点在于要用O(n)解法。第一轮先把所有数放到hashset里面，然后找consecutive sequence。注意每个数被scan之后，都要从hashset中remove出来，不然就会多次扫描，然后变成O(n^2)复杂度了。

代码如下：

public class Solution {
    public int longestConsecutive(int[] num) {
        if(num == null || num.length == 0) return 0;
        HashSet<Integer> set = new HashSet<Integer>();
        for(int e : num){
            set.add(e);
        }
        int max = 1;
        for(int e : num){
            int left = e-1;
            int right = e+1;
            int count = 1;
            while(set.contains(left)){
                count++;
                set.remove(left);
                left--;
            }
            while(set.contains(right)){
                count++;
                set.remove(right);
                right++;
            }
            max = Math.max(count, max);
        }
        return max;
    }
}

时间复杂度和空间复杂度都是O(n)