PAT (Advanced Level) Practice 1041 Be Unique（20分）【哈希】

最新推荐文章于 2023-03-26 13:37:37 发布

我成为一只小羊

最新推荐文章于 2023-03-26 13:37:37 发布

阅读量235

点赞数

本文链接：https://blog.csdn.net/Exupery_/article/details/103766085

版权

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:

Sample Input 2:

5 888 666 666 888 888

Sample Output 2:

None

题意

给出一列数，输出第一个只出现过一次的数，如果没有则输出None

思路

将数据读入时用hash数组记录出现的次数，然后遍历一遍输出第一个出现一次的数。

代码

#include <cstdio>

int h[10005];
int a[100005];

int main() {

    int n;
    scanf("%d", &n);

    for (int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
        h[a[i]]++;
    }

    for (int i = 0; i < n; ++i) {
        if (h[a[i]] == 1) {
            printf("%d", a[i]);
            return 0;
        }
    }

    printf("None");
}