本题要求实现一个函数,要求将顺序表的第i个元素删掉,成功删除返回1,否则返回0;
函数接口定义:
int ListDelete(SqList &L,int i);
其中SqList结构定义如下:
typedef struct{
ElemType *elem;
int length;
}SqList;
裁判测试程序样例:
#include
#include
#define MAXSIZE 5
typedef int ElemType;
typedef struct{
ElemType *elem;
int length;
}SqList;
void InitList(SqList &L);/*细节在此不表*/
int ListDelete(SqList &L,int i);
int main()
{
SqList L;
InitList(L);
int i;
scanf("%d",&i);
int result=ListDelete(L,i);
if(result==0){
printf("Delete Error.The value of i is illegal!");
}else if(result==1){
printf("Delete Success.The elements of the SequenceList L are:");
for(int j=0;j=MAXSIZE) return 0;
else
{
for(int j = i-1 ;j < L.length ;j ++)
{
L.elem[j] = L.elem[j+1];
}
L.length--;
return 1;
}
}
|