Longest Consecutive Sequence

public class Solution {
    public int longestConsecutive(int[] num) {
        if(num == null || num.length == 0)  return 0;
        Set<Integer> set = new HashSet<Integer>();
        for(int i = 0; i < num.length; i++)
        {
            set.add(num[i]);
        }
        int maxLen = 0;
        for(int i = 0; i < num.length; i++)
        {
            if(set.contains(num[i]))
            {
                int tmp = num[i] - 1;
                int len = 1;
                set.remove(num[i]);
                while(set.contains(tmp))
                {
                    set.remove(tmp);
                    len++;
                    tmp--;
                }
                tmp = num[i] + 1;
                while(set.contains(tmp))
                {
                    set.remove(tmp);
                    len++;
                    tmp++;
                }
                maxLen = Math.max(maxLen,len);
            }
        }
        return maxLen;
    }
}