哈希表+思维
思路
代码
class Solution {
public:
int longestConsecutive(vector<int>& nums) {
unordered_set<int> ust;
for(auto num:nums)
ust.insert(num);
int len=0;
for(auto num:ust)
{
if(!ust.count(num-1))
{
int current_num=num;
int now_len=1;
while(ust.count(current_num+1))
{
now_len++;
current_num++;
}
len=max(len,now_len);
}
}
return len;
}
};