PAT甲级-1041 Be Unique

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

这道题的意思大概是输入一些数，然后在这里面找出第一个独特的数，也就是在这里面只出现一次的数。
解题思路:可以用哈希表，输入的时候让表中对应下标的加一，然后再遍历一次哈希表输出第一个为1的数字。

#include<iostream>
using namespace std;

int main()
{
	int N,num[100000],k[10000];
	cin>>N;
	for(int i=0;i<N;i++) {
		cin>>num[i];
		k[num[i]]++;
	}
	for(int i=0;i<N;i++) {
		if(k[num[i]]==1) {
			cout<<num[i];
			return 0;
		}
	}
	cout<<"None";
	return 0;
}