问题 C: Be Unique (20)

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.

输入
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.

输出
For each test case, print the winning number in a line. If there is no winner, print “None” instead.

#include<stdio.h>
#include<string.h>
const int maxn=10010;
int main()
{
	int m;
	while(scanf("%d ",&m)!=EOF)
	{
		int hashTable[maxn]={0}; 
		int temp[m];
		for(int i=0;i<m;i++)
		{
			scanf("%d ",&temp[i]);
			hashTable[temp[i]]++;//出现一次的数字为1，其他大于1
		}
		for(int i=0;i<m;i++)
		{
			if(hashTable[temp[i]]==1)
			{
				printf("%d\n",temp[i]);
				break;
			}
		}
		if(i==m)//如果前面已经在m前判断出hashTable[temp[i]]=1，则i不会到达m，否则就是none
		{
			printf("None");
		}
	}
	return 0;
}