【LeetNode2-1-6】Longest consecutive sequence--C++源代码(VS2015)

#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;

/*
Longest consecutive sequence
*/

int max(int Num_A, int Num_B)
{
return Num_A > Num_B ? Num_A : Num_B;
}

int Solution(const vector<int> &vec)
{
unordered_map<int, bool> used;
for (auto i : vec)
used[i] = false;
int length = 0;
int count = 0;
for (auto i : vec)
{
if (used[i])
continue;
count = 1;
used[i] = true;
for (int j = i + 1; used.find(j) != used.end(); j++)
{
count++;
}
for (int j = i - 1; used.find(j) != used.end(); j--)
{
count++;
}
length = max(count, length);
}
return length;
}

int main()
{
int arr[] = { 2,4,6,1,3,7,9,10,1,3 };
vector<int> vec(&arr[0], &arr[10]);
int length = Solution(vec);

cout << "the length of the longest consecutive sequence is " << length << endl;
system("pause");
return 0;
}