题目

var longestConsecutive = function(nums) {
  if(nums.length===0)return 0;
  //去重
  nums = Array.from(new Set(nums));
  //排序
  nums.sort((x,y)=>x-y);
  let ans = 1;
  let idx = 0;
  for(let i=1;i<nums.length;i++){
    if(nums[i]-nums[i-1]!==1){
      ans = Math.max(ans, i-idx);
      idx = i;
    }
  }
  ans = Math.max(ans, nums.length-idx);
  return ans;
};