算法笔记6112ProblemC 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, 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 S1 - S2 in one line.

样例输入

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

样例输出

31
None

代码展示

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int main()
{
    int n; // n为样例个数
    while(scanf("%d", &n) != EOF)
    {
        int result[10005] = {0};
        int input[100005] = {0};
        int i;
        int temp;
        bool flag = false;

        for(i = 0; i < n; i++)
        {
            scanf("%d", &input[i]);
            result[input[i]]++;
        }

        for(i = 0; i < n; i++)
        {
            if(result[input[i]] == 1)
            {
                flag = true;
                break;
            }
        }
        if(flag)
            cout<<input[i]<<endl;
        else
            cout<<"None"<<endl;
    }
    return 0;
}

小结

这里用到了两个数组记录，之前我认为用一个数组保存输入的数据是多余的，直接用一个临时变量不就得了？但是这个数组可以保存输入数据的顺序，这样就可以找到输入的数据中第一个唯一的。