题解 | #序列中整数去重#
序列中整数去重
https://www.nowcoder.com/practice/6564a2f6e70f4153ad1ffd58b2b28490
#include <stdio.h>
int main() {
int N[1000];
int n, count = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &N[i]);
}
for (int j = 1; j < n - count; j++) {
for (int i = 0; i < j; i++) {
if (N[j] == N[i]) {
for (int k = j; k < n; k++) {
N[k] = N[k + 1];
}
N[n - 1] = N[j];
count++;
j--;
}
}
}
for (int i = 0; i < n - count; i++) {
printf("%d ", N[i]);
}
return 0;
}
Momenta公司福利 593人发布