PAT甲级 1041 Be Unique(20) (STL)

最新推荐文章于 2024-05-22 00:22:29 发布

NHS6671

最新推荐文章于 2024-05-22 00:22:29 发布

阅读量77

点赞数

分类专栏： PAT-甲级文章标签： c++ 职场和发展算法

本文链接：https://blog.csdn.net/NHS6671/article/details/124971618

版权

PAT-甲级专栏收录该内容

70 篇文章 0 订阅

订阅专栏

题目

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.

输入

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.

输出

For each test case, print the winning number in a line. If there is no winner, print None instead.

样例输入

样例输入1:

7 5 31 5 88 67 88 17
样例输入2:

5 888 666 666 888 888

样例输出

样例输出1:

31
样例输出2:

None

题意理解

给你n个数字输出第一个不重复的数字没有就输出None 那么我们简单映射一下就可以了

这题直接用map或者unordered_map STL直接拿来用即可

代码

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int a[N];
map<int,int>ma;

int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        ma[a[i]]++;
    }
    int res;
    int fl=0;
    for(int i=1;i<=n;i++){
        if(ma[a[i]]==1){
           res=a[i];
           fl=1;
           break;
         }
    }
    if(fl)cout<<res<<endl;
    else cout<<"None"<<endl;
    
    return 0;
}