原题:
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
For example,
Given [100, 4, 200, 1, 3, 2]
,
The longest consecutive elements sequence is [1, 2, 3, 4]
. Return its length: 4
.
Your algorithm should run in O(n) complexity.
看到这个题,肯定能想到用hash,但是怎么用呢,比如1,3,4,5,8,9,10,在345连续的数列中,其实有一个保存大小就行了,那我就让第一个元素保存,比如现在看到了3,那么我就试试有没有456。。。每遇到一个加1,直到没有;然后再试21等等,每遇到加1。
代码(72ms):
class Solution {
public:
int longestConsecutive(vector<int> &num) {
unordered_map<int,int>mymap;
int maxNum = 0;
for (int i =0 ;i < num.size();i++){
if(mymap.find(num[i]) == mymap.end() ){
mymap.insert({num[i],1});
}
else{
//如果重复的数也算,则要这句话
// mymap.find(num[i])->second++;
}
}
for (auto it = mymap.begin();it!=mymap.end();it++){
int current = it->first;
//先看比current大的,且和current相连的数
while(mymap.find(++current)!=mymap.end()){
it->second++;
//要及时抹去,要不之后会重复计算
mymap.erase(current);
}
current = it->first;
while(mymap.find(--current)!=mymap.end()){
it->second++;
mymap.erase(current);
}
maxNum = max(maxNum , it->second);
}
return maxNum;
}
};