C 解法, 执行用时: 2ms, 内存消耗: 304KB, 提交时间: 2021-09-18

#include<stdio.h>
int main() {
    int T;
    scanf("%d",&T);
    while(T--) {
        int N;
        int mp[200] = {0};
        scanf("%d",&N);
        int cnt = 0;
        int flag = 0;
        for(int i = 0; i < N; i++) {
            int temp;
            scanf("%d",&temp);
            int mid = mp[0];
            flag = 0;
            for(int j = 0; j < cnt; j++) {
                if(mid != temp) {
                    int t = mid;
                    mid = mp[j+1];
                    mp[j+1] = t;
                }
                else {
                    flag = 1;
                    break;
                }
            }
            if(flag == 0) {
                cnt++;
            }
            mp[0] = temp;
        }
        for(int i = 0; i < cnt - 1; i++) {
            printf("%d ",mp[i]);
        }
        printf("%d\r\n",mp[cnt-1]);
    }
}

C 解法, 执行用时: 2ms, 内存消耗: 348KB, 提交时间: 2021-03-28

#include <stdio.h>
#include <string.h>

int main()
{
    int id[203];
    int ans[203];
    int T,n;
	int i,j,k,ok;
	scanf("%d",&T);
	while (T--)
	{
		k=0;
		scanf("%d",&n);
		for (i=0; i<n; i++)
		{
			scanf("%d",&id[i]);
		}
		for (i=n-1; i>=0; i--)
		{
			ok=1;
			for (j=0;j<=k;j++)
			{
				if (ans[j] == id[i]){ ok=0; break;}
			}
			if (ok)
			{
				if (k == 0)printf("%d",id[i]);
				else printf(" %d",id[i]);
				ans[k++]=id[i];//printf("ans0=%d\n",ans[0]);
			}
		}
		printf("\n");
	}
	return 0;
}