c语言依次向顺序表中插入abc之后再删除第一个元素并观察运行结果,数据结构(c语言） 实验题 求大神！...

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

#include

#include

using namespace std;

#define MaxSize 100

typedef char ElemType;

typedef struct{

ElemType *elem;

int length;

}SqList;

int InitList_Sq(SqList &L)

{

ElemType *l;

l=(ElemType*)malloc(MaxSize*sizeof(ElemType));

L.elem=l;

L.length=0;

return 0;

}

int ListInsert_Sq(SqList &L,int i,ElemType e)

{

int j;

if(i<1||i>L.length+1)

cout<

else if(i==L.length+1)

{

L.elem[L.length]=e;

L.length++;

}

else if(i>=1&&i<=L.length)

{

for(j=L.length;j>=i;j--)

L.elem[j]=L.elem[j-1];

L.elem[i-1]=i;

L.length++;

}

return 0;

}

int ListDelete_Sq(SqList &L,int i,ElemType &e)

{

int j;

if(i<1||i>L.length+1)

cout<

else if(i==L.length)

{

L.length--;

}

else if(i>=1&&i

{

for(j=i-1;j

L.elem[j]=L.elem[j+1];

L.length--;

}

return 0;

}

void Disp_Sq(SqList &L)

{

int i;

for(i=0;i

{

cout<

if(i

cout<";

}

cout<

}

int main()

{

SqList L;

ElemType A,B,C;

A='A';

B='B';

C='C';

InitList_Sq(L);

ListInsert_Sq(L,1,A);

ListInsert_Sq(L,2,B);

ListInsert_Sq(L,3,C);

ListDelete_Sq(L,1,A);

Disp_Sq(L);

return 0;

}