1041 Be Unique (20 point(s))
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
题目大意
给出N个数字,找出第一个只出现1次的数字,如果没有则输出None
水题一个,不说了
代码
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
int hashTable[10005] = { 0 }, arr[100005];
int main()
{
int N, num, i;
int ret = scanf("%d", &N);
for (i = 0; i < N; ++i) {
ret = scanf("%d", &arr[i]);
if(hashTable[arr[i]] < 2)
++hashTable[arr[i]];
}
for (i = 0; i < N; ++i) {
if (hashTable[arr[i]] == 1) {
printf("%d", arr[i]);
break;
}
}
if (i == N) printf("None");
return 0;
}