#include <stdio.h>
#include <stdlib.h>
struct node
{
int *h, len, size;
};
int main()
{
int t, n, i, j, k;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
struct node list;
list.h = (int *)malloc((n + 5) * sizeof(int));
list.len = n + 5;
list.size = (n + 5) * 4;
for(i = 1; i <= n; i++)
{
scanf("%d", &list.h[i]);
}
for(i = 1; i <= n; i++)
{
for(j = i + 1; j <= n; j++)
{
if(list.h[i] == list.h[j])
{
for(k = j; k <= n; k++)
{
list.h[k] = list.h[k + 1];
}
n--;
j--;
}
}
}
for(i = 1; i <= n; i++)
{
if(i != 1)printf(" ");
printf("%d", list.h[i]);
}
printf("\n");
}
return 0;
}
SDUT - 3324 顺序表应用1:多余元素删除之移位算法
猜你喜欢
转载自blog.csdn.net/Miracle_QSH/article/details/82387007
今日推荐
周排行