int main() {
int i, j, t = 0, m, n;
m = 0;
n = 0;
printf("请输入元素个数:\n");
scanf("%d",&n);
int *a = (int*)malloc(sizeof(int)*n);
for (i = 0; i < n; i++){
printf("请输入第%d个元素\n",i+1);
scanf("%d", a + i);
}
funel(a, n);
for (i = 0; i < n; i++)
printf("%d", a[i]);
printf("\n");
}
int funel(int*a, int n){
int *p = (int*)malloc(sizeof(int)*n);
*p = *a;
int t = 1, i; //计数
for (i = 0; i < n; i++){
if (*(p + t-1) != *(a + i+1)){
*(p + t) = *(a + i + 1);
t++;
}
}
for (i = 0; i < t; i++)
a[i] = p[i];
for (i = t-1; i < n; i++)
a[i] = 0;
return t;
}