PAT-A1041-Be Unique

PAT 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,10e4 ]. 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 (≤10 e5) 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.

---

示例：

输入

7 5 31 5 88 67 88 17

输出

31

输入

5 888 666 666 888 888

输出

None

解题思路

 散列的思想，首先存储每个数字出现的次数。之后按照输入的数字顺序遍历HashTable,遇见第一个次数为1的直接break，如果没有一个能够满足就输出None

参考代码

#include <iostream>

const int maxn = 100010; //够大
using namespace std;
int HashTable[maxn] = {0};
int store[maxn];

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int temp;
        cin >> temp;
        store[i] = temp;
        HashTable[temp]++;
    }
    int i;
    for (i = 0; i < n; ++i) {
        if (HashTable[store[i]] == 1) {
            cout << store[i] << endl;
            break; //第一个是1的就直接退出循环
        }
    }
    if (i == n) {
        cout << "None" << endl; //没有满足的情况 利用好下标
    }
    return 0;
}