LeetCode刷题笔录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.

第一反应肯定是拍个序，然后顺序检查后一个元素是不是比前一个元素大1.还要考虑有重复元素的情况。

当然题目要求O(n)时间，排序是不行了。这种需要大量搜索的题目又归结到HashMap神器上面。当然这里用HashSet就可以。

先把数组的元素都丢到hashset里面，然后再扫描一遍数组元素。比如遇到了100，就在set中找99和101.发现都没有，就扫描数组中下一个元素。对于4，找5，发现没有；再找3，发现有，那么把3从set中删除，再找2，还有，再把2删除...

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