PAT甲级1041 Be Unique

最新推荐文章于 2024-07-14 02:48:45 发布

倾鸢染

最新推荐文章于 2024-07-14 02:48:45 发布

阅读量191

点赞数

分类专栏：刷题题解文章标签： PAT 1041 Be Unique

本文链接：https://blog.csdn.net/qq_41895427/article/details/99702825

版权

刷题题解专栏收录该内容

23 篇文章 0 订阅

订阅专栏

题目
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
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

题目意思
给你一个数组，找出第一个没重复的数，输出，若没有，则输出None

思路
爆搜会有一组数据过不了，运行时间超限。直接用桶排记录有没有重复。然后遍历判断的时候，找到了就break，节省时间。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

int hx[100003],mz[10003];

int main()
{
    int n,yy=0,q=0;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&hx[i]);
        mz[hx[i]]++;
    }
    for(int i=0;i<n;i++)
    {
        if(mz[hx[i]]==1)
        {
            q=1;
            yy=hx[i];
            break;
        }
    }
    if(!q)
        printf("None\n");
    else
        printf("%d\n",yy);
    return 0;
}