1041. Be Unique (20)

来源:互联网 发布:淘宝店发展战略 编辑:程序博客网 时间:2024/05/16 06:54
#include<iostream>#include<algorithm>#include<vector>#include<map> #include<string>#include<set>using namespace std;const int N = 10010;int num[N] = {0}; vector<int> all_num;int main(){int n ;cin>>n;for(int i = 0; i < n; i++){int temp;scanf("%d",&temp);num[temp]++;all_num.push_back(temp);}for(int i = 0; i < n; i++){if(num[all_num[i]] == 1){cout<<all_num[i];return 0;}}cout<<"None";return 0;}

0 0
原创粉丝点击