题目链接:点击打开链接
Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1, 104]. The first one who bets on a unique number wins. For example, if there are 7 people betting on 5 31 5 88 67 88 17, then the second one who bets on 31 wins.
Input Specification:
Each input file contains one test case. Each case contains a line which begins with a positive integer N (<=105) and then followed by N bets. The numbers are separated by a space.
Output Specification:
For each test case, print the winning number in a line. If there is no winner, print "None" instead.
Sample Input 1:7 5 31 5 88 67 88 17Sample Output 1:
31Sample Input 2:
5 888 666 666 888 888Sample Output 2:
None我的C++程序:
#include<iostream>
#include<map>
#include<vector>
using namespace std;
int main()
{
int n;
int temp,i=0;
map<int, int> ma;//map.second记录key数字出现次数
vector<int>order;//order的下标用来记录所猜数字的次序
cin >> n;
for (;i <n;i++)
{
scanf("%d",&temp);//输入猜得数字
ma[temp]++;//记录被猜数字出现次数
order.push_back(temp);//数字放入vector
}
for (auto p : order)//根据猜数字的次序,从先到后判断这一数字出现次数
{
if (ma[p] == 1)//如果只出现一次
{
cout << p;
i = -1;//记录有没有唯一数字
break;//结束循环
}
}
if (i==n)//没有唯一数字
cout << "None";
//system("pause");
return 0;
}