【PAT甲级】1041. Be Unique (20)
2016-10-24 17:09
387 查看
#include <stdio.h> int main(int argc, char *argv[]) { int n; scanf("%d", &n); int i, j, k; int cnt[100001] = {0}; int *a = new int ; for (i = 0; i < n; i++) { scanf("%d", &a[i]); cnt[a[i]]++; } for (i = 0; i < n; i++) { if (cnt[a[i]] == 1) { printf("%d\n", a[i]); return 0; } } printf("None\n"); return 0; }
相关文章推荐
- PAT 甲级 1041. Be Unique (20) 【STL】
- PAT甲级1041. Be Unique (20)
- 1041. Be Unique (20) PAT 甲级
- PAT - 甲级 - 1041. Be Unique (20)(Hash散列)
- PAT 甲级 1041. Be Unique (20)
- PAT甲级 1041. Be Unique (20)
- PAT(甲级)1041. Be Unique (20)
- pat甲级1041. Be Unique (20)
- 1041. Be Unique (20)-PAT甲级真题(Hash散列)
- 浙江大学PAT_甲级_1041. Be Unique (20)
- PAT 1041. Be Unique (20)
- PAT-A1041. Be Unique (20)
- PAT-A-1041. Be Unique (20)
- PAT_A 1041. Be Unique (20)
- PAT (Advenced Level) 1041. Be Unique (20) 找第一个只出现一次的数,哈希
- 1041. Be Unique (20)【水题】——PAT (Advanced Level) Practise
- 【PAT】1041. Be Unique (20)
- PAT 1041. Be Unique (20)
- pat 1041. Be Unique (20)
- PAT甲 1041. Be Unique (20)