最长连续序列-LintCode

#ifndef C124_H
#define C124_H
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
class Solution{
public:
/**
* @param nums: A list of integers
* @return an integer
*/
int longestConsecutive(vector<int> &num) {
// write you code here
int len = num.size();
priority_queue<int> que;
for (auto c : num)
{
que.push(c);
}
int m=1,n=1;
num.clear();
for (int i = 0; i < len; ++i)
{
num.push_back(que.top());
que.pop();
}
for (int i = 0; i < len - 1; ++i)
{
if (num[i] == num[i + 1] + 1)
{
m++;
}
else if (num[i] == num[i + 1])
{
continue;
}
else
{
n = n>m ? n : m;
m = 1;
}
}
n = n > m ? n : m;
return n;
}
};

#endif