intlongestConsecutive(vector<int>& nums){
set<int> nums_set;// 去重for(int i =0; i < nums.size(); i++){
nums_set.insert(nums.at(i));}int max =0;for(constint& num : nums_set){// 没有前驱数字if(!nums_set.count(num -1)){int current = num;int count =1;while(nums_set.count(current +1)){
current +=1;
count +=1;}
max = max > count ? max : count;}}return max;}