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

思路：因为数的范围较小，所以可以直接开数组统计每个数字出现的次数。然后再按顺序查询出现数字的次数，输出第一个在整个过程只出现一次的数字。

#include <iostream>

using namespace std;

int main()
{
	bool flag = true;
	int n;
	cin >> n;
	int *b = new int[n+1];
	int a[10001] = {0};
	for (int i=0; i!=n; ++i) {
		cin >> b[i];
	    ++a[b[i]]; //统计每个数的出现次数
	}

	for (int i=0; i!=n; ++i) 
		if (a[b[i]] == 1) {  //首先出现的在整个过程中只出现一次是结果
			 cout << b[i] << endl;
			 flag = false;
			 break;
		}

	if (flag) //没有只出现一次的数字
	  cout << "None" << endl;
  return 0;
}