PAT-A1041 Be Unique 题目内容及题解

最新推荐文章于 2022-05-29 16:18:25 发布

Bourbon_Whiskey_

最新推荐文章于 2022-05-29 16:18:25 发布

阅读量351

点赞数

分类专栏： PAT甲级文章标签： PAT 甲级 OJ 编程学习

本文链接：https://blog.csdn.net/Bourbon_Whiskey_/article/details/86747627

版权

PAT甲级专栏收录该内容

156 篇文章 3 订阅

订阅专栏

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

题目大意

题目给定一组序列，选择一个数字下注，第一个投注唯一数字的人获胜。题目要求输出该数字并返回0值。

解题思路

读取序列并储存，并用Hash法对每个数字提出的数量进行计数；
按照序列顺序验证，找到计数为1的点时输出该数并退出，找不到则输出none；
返回零值。

代码

#include<stdio.h>
#define maxn 100010
int hash[10010];
int bet[maxn];

int main(){
    int N;
    int i,a;
    scanf("%d",&N);
    for(i=0;i<N;i++){
        scanf("%d",&a);
        bet[i]=a;
        hash[a]++;
    }
    for(i=0;i<N;i++){
        if(hash[bet[i]]==1){
            break;
        }
    }
    if(i<N){
        printf("%d\n",bet[i]);
    }else{
        printf("None\n");
    }
    return 0;
}