(个人水平有限,请见谅!)
描述:
给出一个有序数列随机旋转之后的数列,如原有序数列为:[0,1,2,4,5,6,7] ,旋转之后为[4,5,6,7,0,1,2]。 假定数列中无重复元素,且数列长度为奇数。 求出旋转数列的中间值。如数列[4,5,6,7,0,1,2]的中间值为4。
输入:
4,5,6,7,0,1,2。
输出:
4。
输入样例:
1
1,2,3
4,5,6,7,0,1,2
12,13,14,5,6,7,8,9,10
输出样例:
1
2
4
9
代码示例:
#include <iostream>
#include <bits/stdc++.h>
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());
cout << vec[vec.size()/2] << endl;
}
return 0;
}