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, 10^4^]. 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 (<=10^5^) 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
题目大意:给出n个数字,要求输出第一个只出现一次的数字,如果不存在,输出None.
分析:因为题目限定了所给数字小于等于10^4,所以可以直接开一个int型数组的哈希表来存放这些数字的出现次数。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
using namespace std;
int a[100001], HashTable[10001] = {0};
int main() {
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
HashTable[a[i]]++;
}
int ans = -1;
for(int i = 0; i < n; i++) {
if(HashTable[a[i]] == 1) {
ans = a[i];
break;
}
}
if(ans == -1) {
printf("None");
} else {
printf("%d", ans);
}
return 0;
}