用数组记录更好,我这是为了练习unordered_map
#include<cstdio>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<unordered_map>
#include<algorithm>
#define maxn 100100
typedef long long ll;
using namespace std;
int main() {
int num[maxn];
int N, a;
unordered_map<int, vector<int> > mp;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &a);
mp[a].push_back(a);
num[i] = a;
}
bool flag = false;
for (int i = 0; i < N; i++) {
if (mp[num[i]].size() == 1) {
printf("%d\n", num[i]);
flag = true;
break;
}
}
if (flag == false) printf("None\n");
}