自己 版本吧1 不合格
class Solution {
public:int longestConsecutive(vector<int>& nums) {if (nums.empty()) return 0;//1 数组排序// 2 遍历 i 0-(length(num)-1)// num[i+1]-num[i]==1 创建map 添加到后面// 否则单独创建一个 map列表// 最后统计最长的队列for(int i =0;i<nums.size();++i){for(int j =i+1;j<nums.size();++j){if(nums[j]<nums[i]){int temp=nums[j];nums[j]=nums[i];nums[i]=temp;}}//std::cout << nums[i] << " ";}//std::cout <<std::endl;// std::unordered_map<int,vector<int>> umap;int tmep_=1;int max_=1;for(int i =0;i<(nums.size()-1);++i){// std::cout<< i << " "<< nums[i+1]<< " - " << nums[i] <<std::endl;if((nums[i+1]-nums[i])==1){tmep_=tmep_+1;//std::cout<< "tmep_ " <<tmep_ <<std::endl;if(tmep_>max_){max_=tmep_; }}else if(nums[i+1]==nums[i]){continue;}else{if(tmep_>max_){max_=tmep_+1; }tmep_=1;}}return max_;}
};
