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⁴]. 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⁵) 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

---

找出第一个独特的数，用count数组储存每个数有多少个，还有用nums数组储存有哪些数。最后输出第一个count值为1的数（如果有）或者如果没有独特的数输出'None‘。

代码：

#include <iostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <cstdio>
using namespace std;

int main()
{
	int n;
	cin>>n;
	int count[100001];
	vector<int>nums;
	for(int i=0;i<n;i++)
	{
		int num;
		cin>>num;
		if(count[num]==0) nums.push_back(num);
		count[num]++;
	}
	bool flg=true;
	for(int i=0;i<nums.size();i++)
	{
		if(count[nums[i]]==1&&flg) 
		{
			cout<<nums[i];
			flg=false;
		}
	}
	if(flg) cout<<"None";
}