算法初步——哈希表A1041.Be Unique

 

 

#include 
#include
#include <string>
using namespace std;
const int MAX_LEN = 10005;
int main(){
    int n;
    cin>>n;
    int temp[MAX_LEN];
    for(int i=0;ii){
        temp[i] = 0;
    }
    int result[n];
    for(int i=0;ii){
        //cin>>temp[i];
        int t;
        cin>>t;
        temp[t]++;
        result[i] = t;
    }
    int i;
    for(i =0;ii){
        if(temp[result[i]] == 1){
            cout<<result[i];
            break;
        }
    }
    if(i == n){
        cout<<"None";
    }
    system("pause");
    return 0;
}