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,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

/*
    题意：在输入一组数据中，找到第一个唯一的数，输出
         没有就输出None
*/

#include <iostream>
#include <map>
using namespace std;
int tmp[100005]; //存放输入的数据

int main(){
    map<int, int> mp; //记录每个数 输入了几次
    int n, m;
    cin >> n;
    for(int i=0; i<n; i++){ //每输入一个数，就让这个数的次数加一
        cin >> tmp[i];
        m = tmp[i];
        mp[m]++;
    }
    
    for(int i=0; i<n; i++){ //因为数组中就是输入顺序存储的，所以碰到第一个唯一的数直接输出，然后返回就可以
        int t = tmp[i];
        if(mp[t] == 1){
            cout << t << endl;
            return 0;
        }
    }
    cout << "None" << endl; //如果没有找到，就输出None
    return 0;
}