PAT 甲级 1041 Be Unique (20分)

题目

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

Input Specification:

Each input file contains one test case. Each case contains a line which begins with a positive integer N (≤10⁵) 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

题目大意

给出N个数字，找到第一个没有重复的数字并输出，没有则输出None

思路

遍历第一次用数组记录每个数字出现的次数，遍历第二次看当前数字在记录中出现次数是否等于1，是则输出；遍历结束也没有则输出None

代码

#include<bits/stdc++.h>
using namespace std;
int main(int argc, const char * argv[]) {
    int N, cnt[10010]={0};
    cin>>N;
    vector<int> v(N);
    for(int i=0; i<N; i++){
        cin>>v[i];
        cnt[v[i]]++;
    }
    for(int i=0; i<N; i++)
        if(cnt[v[i]] == 1){
            cout<<v[i];
            return 0;
        }
    cout<<"None";
    return 0;
}