题解 | #序列中整数去重#
序列中整数去重
https://www.nowcoder.com/practice/6564a2f6e70f4153ad1ffd58b2b28490
#include <stdio.h>
#include <stdio.h>
int main()
{
int n = 0;
scanf("%d", &n);
int arr1[1000] = { 0 };
int arr2[1000] = { 0 };
int i = 0;
int j = 0;
int m = 0;
int count = 0;
for (i = 0; i < n; i++)
{
scanf("%d", &arr1[i]);
}
for (i = n - 1; i >= 0; i--)
{
int num = 0;
for (j = i - 1; j >= 0; j--)
{
if (arr1[j] == arr1[i])
{
num = 1;
break;
}
}
if (num == 0)
{
count++;
arr2[m] = arr1[i];
m++;
}
}
for (m = count - 1; m >= 0; m--)
{
printf("%d ", arr2[m]);
}
return 0;
}

腾讯公司福利 1143人发布