(个人水平有限,请见谅!)
描述:
输入一个乱序的连续数列,输出其中最长连续数列长度,要求算法复杂度为 O(n) 。
输入:
54,55,300,12,56。
输出:
3。
输入样例:
100,4,200,1,3,2
54,55,300,12
1
5,4,3,2,1
1,2,3,4,5,6
输出样例:
4
2
1
5
6
代码示例:
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <string>
using namespace std;
int main()
{
char line[1000001];
int temp = 0;
while (cin.getline(line, 1000000)) {
vector<int> vec;
char *p = strtok(line,",");
while(p){
sscanf(p,"%d",&temp);
vec.push_back(temp);
p = strtok(NULL,",");
}
sort(vec.begin(), vec.end());
int max_a = 1;
int max_n = 1;
for (int i = 0; i < vec.size()-1; i++){
if (vec[i + 1] == vec[i] + 1){
max_n++;
if (max_n > max_a)
max_a = max_n;
}
else
max_n = 1;
}
cout << max_a << endl;
}
return 0;
}