PAT甲级1041 Be Unique (20 分)

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

 

 

思路：

     用一个数组记录出现的次数，并且有一个数组存储单个数字，即第一次出现才存入数组，以减少后面遍历的次数。当发现出现次数为1 的数，则输出。

    

参考代码：

#include<cstdio>
#include<vector>
using namespace std;
int n;
vector<int> ans;
int exist[10001];
int main(){
	scanf("%d", &n);
	for(int i = 0; i < n; ++i){
		int temp;
		scanf("%d", &temp);
		if(!exist[temp])	ans.push_back(temp);
		exist[temp]++;
	}
	for(int i = 0; i < ans.size(); ++i)
		if(exist[ans[i]] == 1){
			printf("%d", ans[i]);
			return 0;
		}
	printf("None");
	return 0;
}