class Solution {
public int longestConsecutive(int[] nums) {
Set<Integer> set = new HashSet<>();
int count = 0;
int maxV = 0;
for (int i = 0; i < nums.length; i++) {
set.add(nums[i]);
}
for (int i = 0; i < nums.length; i++) {
count = 1;
if(set.contains(nums[i] - 1)){
continue;
}
while(set.contains(nums[i] + count)){
count += 1;
}
maxV = Math.max(maxV, count);
}
return maxV;
}
}
我这样写,nums[i] + count是一个较为精巧的点,就不用另外新建一个变量来更新连续的值。