PAT (Advenced Level) 1041. 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⁴]. 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⁵) 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就输出结果并退出。否则输出None。

/*2015.7.25cyq*/
#include <iostream>
#include <vector>
using namespace std;

int main(){
	int N;
	cin>>N;
	vector<int> data;
	vector<int> h(10001);
	int x;
	for(int i=0;i<N;i++){
		cin>>x;
		data.push_back(x);
		h[x]++;
	}
	for(int i=0;i<N;i++){
		if(h[data[i]]==1){
			cout<<data[i];
			return 0;
		}
	}
	cout<<"None";
	return 0;
}