没难度上代码。
#include <bits/stdc++.h>
using namespace std;
unordered_map<int, int> mp;
vector<int> v;
int main() {
int n, a, flag = 1;
scanf ("%d", &n);
for (int i = 0; i < n; i++) {
scanf ("%d", &a);
mp[a]++;
v.push_back(a);
}
for (auto it : v) {
if (mp[it] == 1) {
printf ("%d", it);
flag = 0;
break;
}
}
if (flag == 1) cout << "None";
}