}
int main()
{
FILE wf,in;
int a[N]={ 2,2,2,3,4,4,5,6,6,6,6,7,7,8,9,9,10,10,0,0}, i, n=20;
printf("The original data :\n");
for(i=0; i<n; i++)
printf("%3d",a[i]);
n=fun(a,n);
printf("\n\nThe data after deleted :\n");
for(i=0; i<n; i++)
printf("%3d",a[i]);
printf("\n\n");
/****************************/
in=fopen("in50.dat","r");
wf=fopen("out50.dat","w");
fscanf(in,"%d",&n);
for(i=0;i<n;i++)
fscanf(in,"%d",&a[i]);
n=fun(a,n);
for(i=0; i<n; i++)
fprintf(wf,"%3d",a[i]);
fclose(wf);
fclose(in);
/*****************************/
return 0;
}
删除数组重复元素
#include <stdio.h>
#define N 80
int fun(int a[], int n)
{
//Begin/
int p,j,k,i=10,flag=1;
for(p=0; p<n; p++)
{
for(j=0; j<n-1-p; j++)
{
if(a[j]==a[j+1])
{
a[j+1]=a[j+2];
}
}
}
return i;
//End**/
}
int main()
{
int a[N]= { 2,2,2,3,4,4,5,6,6,6,6,7,7,8,9,9,10,10,0,0}, i;
int n=fun(a,N);
int j;
for(j=0; j<n; j++)
{
printf("%d ",a[j]);
}
return 0;
}
#include <stdio.h>
#define N 80
int fun(int a[], int n)
{
// / Begin /
int i, j, k = 0;
for (i = 0; i < n; ++i) //i用来遍历数组
{
for (j = i + 1; j < n && a[i] - a[j]; ++j)
;
if (!(j - n)) //没有重复元素
a[k++] = a[i]; //a[]看作两个数组
}
return k; //返回删除后的有效长度
// / End ** /
}