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, 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.

理解

找出第一个不重复的数字，不存在则输出None。

思路

用动态数组a记录数字，用动态数组b记录重复，有重复则记为1，最后找出b中第一个值为0的位置即可。

代码

#include<iostream>
using namespace std;
int main()
{
	int n=0;
	cin>>n;
	int *a=new int[n];
	int *b=new int[n];
	for(int i=0; i<n; i++)
	{
		cin>>a[i];
		b[i]=0;
	}
	for(int i=0; i<n; i++)
	{
		for(int j=i+1; j<n; j++)
		{
			if(a[i]==a[j])
			{
				b[i]=1;
				b[j]=1;
			}
		}
	}
	for(int i=0; i<n; i++)
	{
		if(b[i]==0)
		{
			cout<<a[i];
			break;
		}
		if(i==n-1&&b[i]==1)
		{
			cout<<"None";
		}
	}
	return 0;
}