|
马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
//长度为n的顺序表A,请写出删除该表中数据信息为item的元素的算法
#define MaxSize 1000
int A[MaxSize] ;
int n ;
void DELETEITEM2(int A[],int &n,int item)
{
int i,k = -1;
for (i = 0;i < n;i++)
{
if (A[i] == item) /*若元素A[i]满足条件*/
{
k++;
}
else A[i-k-1] = A[i]; /*若元素A[i]不满足条件,将A[i]送表的i-k-1处*/
}
n = n-k-1; /*修改表的长度*/
}
int main()
{
int a[] = {10,20,20,30,40,50,30,59,30,20,60,30};
DELETEITEM2(a,12,30);
int i = 0;
for (i;i < 12 ;i++)
{
printf("%d\n",a[i]);
}
}
下面这个是我按照c语言修改的,感觉你没有把指针做函数参数弄懂,这个算法挺好的,相互学习啦  #include <stdio.h>
void DELETEITEM2(int A[],int *n,int item)
{
int i,k = -1;
for (i = 0;i < *n;i++)
{
if (A[i] == item) /*若元素A[i]满足条件*/
{
k++;
}
else A[i-k-1] = A[i]; /*若元素A[i]不满足条件,将A[i]送表的i-k-1处*/
}
*n = *n-k-1; /*修改表的长度*/
}
int main()
{
int a[] = {10,20,20,30,40,50,30,59,30,20,60,30};
int n = 12;
DELETEITEM2(a,&n,30);
for (int i=0; i < n; i++)
{
printf("%d\n",a[i]);
}
}
|
|