问题描述(原题链接)
代码:
class Solution {
public int longestConsecutive(int[] nums) {
//利用set
Set<Integer> set = new HashSet<Integer>();
for(int i=0;i<nums.length;i++)
set.add(nums[i]);
int maxLen =0;
for(int i=0;i<nums.length;i++){
int num = nums[i];
if(!set.contains(num-1)){
int tempLen = 1;
while(set.contains(num+1)){
tempLen++;
num++;
}
maxLen=Math.max(maxLen,tempLen);
}
}
return maxLen;
}
}