从0,1,2,...,n这n+1个数中取n个数,然后找出这n个数中缺少的那个数
#include <iostream>
#include<vector>
using namespace std;
int main()
{
vector<int> num ;
char ch;
while (cin>>ch){
if ((ch >= '0') && (ch <= '9'))
{
int input = ch - '0'; //字符串转数字
num.push_back(input);
}
}
/*for (auto i=num.begin(); i!=num.end(); i++)
{
cout << *i << ' ';
}*/
for (int i = 0; i<num.size()-1; i++)
{
if (num[i + 1] - num[i] != 1) //利用相邻数字相差1
cout << (num[i + 1] +num[i]) / 2;
}
return 0;
}