【笨方法学PAT】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​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.。

三、考点

Hash

四、注意

1、最开始的时候，数组嵌套容易混淆，所以使用了unordered_map，报错，半天找不到问题，原来是对unordered_map的理解有误，不是按照插入顺序排序，而是随意的顺序。

五、代码

#include<iostream>
#include<unordered_map>
#define N 100001
using namespace std;
int main() {
	//read
	int n;
	cin >> n;
	int index[N] = {0}, val[N] = { 0 };
	for (int i = 0; i < n; ++i) {
		int a;
		cin >> a;
		index[i] = a;
		val[a]++;
	}

	//solve
	bool flag = true;
	for (int i = 0; i < N; ++i) {
		if (val[index[i]] == 1) {
			cout << index[i];
			flag = false;
			break;
		}
	}

	if (flag == true)
		cout << "None";

	system("pause");
	return 0;
}