1041 Be Unique (20 分) 水题

最新推荐文章于 2022-08-21 10:27:31 发布

ZXX_1999

最新推荐文章于 2022-08-21 10:27:31 发布

阅读量130

点赞数

分类专栏：散列

本文链接：https://blog.csdn.net/ZXX_1999/article/details/100556637

版权

散列专栏收录该内容

4 篇文章 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,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:

Sample Input 2:

5 888 666 666 888 888

Sample Output 2:

None

具体代码

注意：一定要小心，刚开始输入的字符串的内容必须作为hashtable的下标来查找，这样才是第一个出现的唯一的数字，如果直接cong1到N遍历数组hashtable，出来的答案是唯一但不是第一个出现的。

#include <cstdio>
int main(){
    int n;
    scanf("%d",&n);
    int bet[100001];
    int hashtable[10001]={0};//因为数字范围在1到1
    for(int i=0;i<n;i++){
        scanf("%d",&bet[i]);
        hashtable[bet[i]]++;

    }
    int ans=-1;
    for(int i=0;i<n;i++){
        if(hashtable[bet[i]]==1){ans=bet[i];break;}
    }
    if(ans==-1)printf("None\n");
    else printf("%d\n",ans);
    return 0;

}