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.

输入

Each input file contains one test case. Each case contains a line which begins with a positive integer N ($\le 10^5$) 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.

思路

用数组存一下判断是不是唯一即可

代码

#include<iostream>
#include<cstdio>
using namespace std;
int num[100010], ci[10010] = { 0 };
int main()
{
	int N;
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> num[i];
		ci[num[i]]++;
	}
	int flag = 0;
	for (int i = 0; i < N; i++)
	{
		if (ci[num[i]] == 1)
		{
			printf("%d\n", num[i]);
			return 0;
		}
	}
	printf("None\n");
}