leetcode128 最长连续序列
题目详情
先排序方法
public class Solution {
public int longestConsecutive(int[] nums){
if(nums.length < 2)
return nums.length;
Arrays.sort(nums);
int length = 1;
int maxLen = length;
for(int i = 1; i < nums.length; i ++){
int nn = nums[i] - nums[i - 1];
if(nn == 1)
maxLen = Math.max(maxLen, ++length);
if(nn > 1)
length = 0;
}
return maxLen;
}
}