Joah_Ge的博客

#include<iostream> using namespace std; int main() 后面什么都不会...

PAT A 1041 Be Unique

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

直接暴力比较会超时,HashTable

#include<cstdio>

const int maxn = 100010;
int HashTable[maxn] = { 0 };
int digit[maxn];

int main() {
    int n, i;
    scanf("%d", &n);

    for (i = 0; i < n; i++) {
        scanf("%d", &digit[i]);
        HashTable[digit[i]]++;
    }
    for (i = 0; i < n; i++) {
        if (HashTable[digit[i]] == 1) {
            printf("%d\n", digit[i]);
            break;
        }
    }
    if (i == n) printf("None\n");
    return 0;
}
阅读更多
个人分类: PAT (Advanced Level)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭