算法笔记-问题 C: Be Unique (20)

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了算法笔记-问题 C: Be Unique (20)，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1174字，纯文字阅读大概需要2分钟。

内容图文

问题 C: 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.

输入

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.

输出

For each test case, print the winning number in a line. If there is no winner, print "None" instead.

样例输入 Copy

7 5 31 5 88 67 88 17
5 888 666 666 888 888

样例输出 Copy

31
None

代码：

#include <bits/stdc++.h>

using namespace std;

const int maxn = 100010;
int hashTable[maxn] = {0};

int main(){
    int n;
    while(scanf("%d", &n)!=EOF){
        vector<int> bets;
        while(n--){
            int temp;
            scanf("%d", &temp);
            bets.push_back(temp);
            hashTable[temp]++;
        }
        int flag = 0;
        for(int i=0; i<bets.size(); i++){
            if(hashTable[bets[i]]==1){
                printf("%d\n", bets[i]);
                flag = 1;
                break;
            }
        }
        if(flag==0) printf("%s\n", "None");
        memset(hashTable, 0, sizeof(hashTable));
    }
    return 0;
}

 

内容总结

以上是互联网集市为您收集整理的算法笔记-问题 C: Be Unique (20)全部内容，希望文章能够帮你解决算法笔记-问题 C: Be Unique (20)所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

---