#include
int main()
{ int n,k,m,i,j,t;
scanf("%d",&m);
int a[n];
for(i=0;iscanf("%d",&a[i]);}
for(i=0;ifor(j=i+1;j<=m;j++)
{if(a[i]==a[j])
{ for(t=j;t-1;t++)
{
a[t]==a[t+1];
j--;
m--;}
}
}} printf("%d",m);
printf("\n");
for(j=0;jprintf("%d ",a[j]);
}
return 0;
}

修改如下,供参考:
#include <stdio.h>
#define N 20
int main()
{
int i, j, n, a[N],flg;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (flg = a[0],i = 0,j = 0; i < n; i++)
{
if (a[i] - flg)
a[j++] = a[i];
if (i == 0)
a[j++] = a[i];
flg = a[j-1];
}
printf("删除相邻重复元素后的数组:\n");
for (i = 0; i < j; i++)
printf("%4d", a[i]);
printf("\n");
return 0;
}