128.Longest Consecutive Sequence

 1     public int longestConsecutive(int[] nums) {
 2         if(nums.length == 0) {
 3             return 0;
 4         }
 5         //排序
 6         Arrays.sort(nums);
 7         int cnt = 1, ma = 1;
 8         //逐一遍历
 9         for(int i = 1; i < nums.length; i++) {
10             //去除重复值
11             if(nums[i] == nums[i - 1]) {
12                 continue;
13             }
14             //如果连续
15             else if(nums[i] == nums[i - 1] + 1) {
16                 cnt++;
17             }
18             //一旦不连续，更新ma和cnt
19             else {
20                 if(cnt > ma) {
21                     ma = cnt;
22                 }
23                 cnt = 1;
24             }
25         }
26         //由于可能整个数组一直连续，所以最后还应该再判断一下
27         if(cnt > ma) {
28             ma = cnt;
29         }
30         return ma;
31     }