题解 | 序列中整数去重
序列中整数去重
https://www.nowcoder.com/practice/6564a2f6e70f4153ad1ffd58b2b28490
#include <stdio.h> int main() { int n, i, g = 0; int arr1[1000] = {0}; int arr2[1000] = {0}; int mark[1001] = {0};//用于标记重复出现的数 scanf("%d", &n); for(i = 0;i < n;i++) { scanf("%d", &arr1[i]); } for(i = 0;i < n;i++) { if(!mark[arr1[i]])//判断是否重复出现 { arr2[g++] = arr1[i]; mark[arr1[i]] = 1;//标记该数已出现过 } } for(i = 0;i < g;i++) { printf("%d ", arr2[i]); } return 0; }