import java.util.Arrays;
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
public int longestConsecutive(int[] nums) {
int len = nums.length;
Arrays.sort(nums);
int index = 0;
int tempLen = 1;
int ret = len == 0 ? 0 : 1; // 特殊情况,数组长度为0,或1;
for (int i = 0; i < len - 1; i++) {
index = nums[i];
// 越过重复元素
if (index == nums[i + 1]) {
continue;
}
if (index + 1 == nums[i + 1]) {
tempLen++;
// 取连续最大值
if (tempLen > ret) {
ret = tempLen;
}
} else {
tempLen = 1;
}
}
return ret;
}
}
05-11
377
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
12-04
1084
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
05-28