Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1041. Be Unique

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.

Input Specification

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.

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 <cstdio>
#include <map>
using namespace std;

const int mx = 100000 + 10;
int a[mx], n;
map<int, int> mp;

int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++) scanf("%d", a+i), mp[a[i]]++;
	int ans, exist = 0;
	for (int i = 0; i < n; i++)
		if (mp[a[i]] == 1)
		{
			ans = i; exist = 1; break;
		}
	if (exist) printf("%d\n", a[ans]);
	else printf("None\n");
	return 0;
}
上一篇: 下一篇:

我的博客

NoAlGo头像编程这件小事牵扯到太多的知识,很容易知其然而不知其所以然,但真正了不起的程序员对自己程序的每一个字节都了如指掌,要立足基础理论,努力提升自我的专业修养。

站内搜索

最新评论