问题
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 17
Sample Output 1:
31
Sample Input 2:
5 888 666 666 888 888
Sample Output 2:
None
解决方法
分析:hash散列。建⽴⼀个数组,存储每个数字出现的次数,然后遍历⼀遍输⼊的顺序看是否有出现次数为1的数字。
#include<iostream>
using namespace std;
int main()
{
int a[100005] = { 0 }, hash[100005] = { 0 };
int n,result=-1;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
hash[a[i]]++;
}
for (int i = 0; i < n; i++)
{
if (hash[a[i]] == 1)
{
result = a[i];
break;
}
}
if (result == -1) printf("None");
else printf("%d", result);
return 0;
}
后记
注意数组空间一定要>=10^4,因为少写了一个0,导致测试点过不了,一定要注意。