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, 104]. 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 (<=105) 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.

输入例子:
7 5 31 5 88 67 88 17

输出例子:
31

---

大意
给你一个数组，需要你找出数组中第一个出现一次的数。没则输出“None”。
分析
前道题，无需多言。
思路
用一个数组input[]来记录输入数据，因为所求的答案与输入顺序有关。再开一个数组
num[i]来记录 记录整数i出现的次数。遍历input找符合条件的数即可即可。

---

MyCode

#include<iostream>
#include<stdio.h>
using namespace std;
const int maxn = 100009;
int num[maxn];	//记录 maxn 出现的次数
int input[maxn];	//记录输入数据
int main(){
	int n;
	cin >> n;
	for (int i = 0; i < n; i++){
		scanf("%d", &input[i]);
		num[input[i]]++;
	}
	int ans = -1;
	//找到第一个只出现一次的数
	for (int i = 0; i < n; i++){
		if (num[input[i]] == 1){
			ans = input[i];
			break;
		}
	}
	if (ans == -1)cout << "None" << endl;
	else cout << ans << endl;
}