第十一章模拟 5 AcWing 1525. 独一无二

ゝ一纸荒年。 2024-03-31 12:30 25阅读 0赞

## 第十一章 模拟 5 AcWing 1525. 独一无二 ##

### 原题链接 ###

[AcWing 1525. 独一无二][AcWing 1525.]

### 算法标签 ###

模拟

### 思路 ###

依题意模拟

### 代码 ###

#pragma GCC optimize(2)
    #pragma GCC optimize(3)
    #include<bits/stdc++.h>
    #define int long long
    #define xx first
    #define yy second
    #define ump unordered_map
    #define us unordered_set
    #define pq priority_queue
    #define rep(i, a, b) for(int i=a;i<b;++i)
    #define Rep(i, a, b) for(int i=a;i>=b;--i)
    using namespace std;
    typedef pair<int, int> PII;
    const int N=100005, inf=0x3f3f3f3f3f3f3f3f, mod=1e9+7;
    const double Exp=1e-8;
    //int t, n, m, cnt, ans; 
    int n, a[N], c[N];
    inline int rd(){
       int s=0,w=1;
       char ch=getchar();
       while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
       while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
       return s*w;
    }
    void put(int x) {
        if(x<0) putchar('-'),x=-x;
        if(x>=10) put(x/10);
        putchar(x%10^48);
    }
    signed main(){
    	ios::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
    	n=rd();
    	rep(i, 0, n){
            a[i]=rd();
            c[a[i]]++;	 
    	}
    	rep(i, 0, n){
           if(c[a[i]]==1){
               printf("%lld", a[i]);
               return 0;
           }
    	}
    	puts("None");
    	return 0;
    }

### 参考文献 ###

[AcWing 1525. 独一无二（PAT甲级辅导课）y总视频讲解][AcWing 1525. _PAT_y]

原创不易  
转载请标明出处  
如果对你有所帮助 别忘啦点赞支持哈  
![在这里插入图片描述][9cb4cb80a18345158f8a69e2f196e5b9.png]

[AcWing 1525.]: https://www.acwing.com/problem/content/1527/
[AcWing 1525. _PAT_y]: https://www.acwing.com/video/1238/
[9cb4cb80a18345158f8a69e2f196e5b9.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/31/edf4b11c2a344ce8b47e0f4946b5eacb.png