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.

思路简单，拿空间换时间，想到用Set,之后的就比较简单。遍历数组，找到数组前后连续起来的数字总和，并在set中删除已查找过的数，记录每次count的最大值，最后返回。

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