[ PAT-A ] 1041 Be Unique (C++)

题目描述

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.

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

---

解题思路

题目大意
输入一组数,按其顺序找到第一个没有重复的数字
思路
哈希散列

---

代码设计

//AC代码
//zhicheng
#include<cstdio>
#include<iostream>
using namespace std;
// zhicheng
// August 23,2018
const int maxn=100000+5;
int m[maxn]={0},a[maxn];
int main()
{
    int n,_;
    for(scanf("%d",&n),_=n;_;_--) {scanf("%d",&a[_]);m[a[_]]++;}
    for(int i=n;i>0;i--)if(m[a[i]]==1) {printf("%d\n",a[i]);return 0;}
    printf("None\n");
    return 0;
}

---

有关PAT (Basic Level) 的更多内容可以关注 ——> PAT-B题解

有关PAT (Advanced Level) 的更多内容可以关注 ——> PAT-A题解

铺子日常更新，如有错误请指正
传送门：代码链接 PTA题目链接 PAT-A题解