写完线性表实验代码后，有些错误 不会调试 求大神帮帮忙!
ps.错误截图：图片说明
代码：
#include
#include
#include
#define LIST_INIT_SIZE 100 //线性表存储空间的初始分量
#define LISTINCREMENT 10 //线性表存储空间的分配增量
typedef struct{
ElemType* elem; //存储空间基址
int length; //当前长度
int listsize; //当前分配的存储容量
}SqList;
Status InitList(SqList &L){
L.elem=(ElemType )malloc(LIST_INIT_SIZE * sizeof(ELemType));
if(! L.elem) exit(OVERFLOW);
L.length =0;
L.listsize=LIST_INIT_SIZE;
return OK;
}//初始化空线性表
Status ListInsert(SqList &L,int i,ElemType e){
if(iL.length+1)return ERROR;
if(L.length>=L.listsize){
newbase=(ElemType *)realloc(L.elem,(L,listsize+LISTINCREMENT)*sizeof(ElemType));
if(!newbas)exit(OVERFLOW);
L.elem=newbase;
L.listsize+=LISTINCREMENT;
}
q=&(L.elem[i-1]);
for(p=&(L.elem[L.length-1];p>=q;--p)(p+1)=*p;
q=e;
++l.length;
return OK;
}//插入元素
Status ListDelete(SqList &L,int i,ElemType &e){
if((iL.length)) return ERROR;
p=&(L.elem[i-1]);
e=*p;
q=L.elem+L.length-1;
for(++p;p<=q;++p)(p-1)=*p;
--L.length;
return OK;
}
Status DestroyList(SqList &l)
{
free(&L);
return OK;
}//销毁
Status ClearList(SqList &L){
L.length=0;
return OK;
}//重置
bool ListEmpty(Sqlist L){
if(L.length==0)
{
return true;
}
else{
return false;
}
}//判断是否是空表，若是空输出true 否则输出false
int ListLength(SqList L){
return L.length;
}
Status GetElem(SqList L,int i,ElemType &e){
if(i=L.lenth) return ERROR;
e=L.elem[i-1];
return OK;
}//用e返回L中第i个值
int LocateElem(SqList L,ElemType e,bool (*equal)(ElemType,ElemType)){
int i=1;
ElemType*p=L.elem;
while(i<=length && !(*equal)(*p++,e)) ++i;
if(i<=L.length) return i;
else return 0;
}
Status PriorElem(SqList L,ElemType cur_e,ElemType &pre_e){
int i=1;
while(i<=L.length && !(cur_e==L.elem[i-1])) ++i;
if(iL.length){
return ERROR;
}
pre_e =L.elem[i-2];
return OK;
}//返回前驱
Status NextElem(SqList L,ElemType cur_e,ElemType &next_e){
int i=1;
while(i<=L.length && !(cur_e==L.elem[i-1])) ++i;
if(iL.length)
return ERROR;
next_e=L.elem[i];
return OK;
}//后继
Status ListInsert(Sqlist &L,int i,ElemType e){
if(iL.length+1) return ERROR;
if(L.length>=L.listsize){
ElemType newbase=(ElemType)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));
if(!newbase)exit(OVERFLOW);
L.elem=newbase;
L.listsize+=LISTINCREMENT;
}
ElemType *q=&(L.elem[i-1]);
ElemType *p;
for(p=&(L.elem[L.length-1]);p>=q;--p;)
*(P+1)=*p;
*q=e;
++L.length;
return OK;
}
Status ListTraverse(SqList L,bool(*visit)(ElemType)){
int i=1;
ElemType *p=L.elem;
while(i<=L.length && (*visit)(*p++)) ++i;
return OK;
}//遍历
int main()
{
printf("1---初始化一个列表\n");
printf("2---显示线性表\n");
printf("3---获取线性列表指定位置的元素\n");
printf("4---求线性表长度\n");
printf("5---求前驱\n");
printf("6---求后继\n");
printf("7---在线型表指定位置插入元素\n");
printf("8---删除指定位置元素\n");
printf("9---清空线性列表\n");
printf("10---判断线性列表是否为空\n");
printf("11---销毁线性列表\n");
printf("12---合并两个非递减数列");
printf(" 退出---输入负数：\n");
Sqlist L;
ElemType e;
ElemType pre_e;
ElemType next_e;
for(int i=0;i<20;i++)
{
e=i+1;
ListInsert(L,i+1,e);
}
int j,k;
printf("输入想要的操作 ");
scanf("%d",&j);
switch(j){
case 1:InitList(L);
if(ListEmpty(L))
{
printf("空");
}
break;
case 2:ListTraverse(L,visit);
break;
case 3:
printf("输入想要的元素");
scanf("%d",&k);
if(k<0 || k>20)
{
printf("输入错误");
}
else{
GetElem(L,k,equal);
}
break;
case 4:
printf("线性表长度是：",ListLength(L));
break;
case 5:
pirntf("输入求第几个数的前驱");
scanf("%d",&k);
PriorElem(L,k,pre_k);
printf("前驱是:%d\n",pre_k);
break;
case 6:
pirntf("输入求第几个数的后继");
scanf("%d",&k);
NextElem(L,k,next_k);
printf(后继是:%d\n",next_k);
break;
case 7:
printf("在第几个位置插入元素?");
scanf("%d",&k);
printf("插入的数字是:");
int x;
scanf("%d",&x);
ListInsert(L,k,x);
break;
case 8:
printf("输入要删除的元素的位置");
scanf("%d",&k);
ListDelete(L,k,e);
printf("所删除的元素是:%d",e);
ListTraver(L,visit);
break;
case 9:
ClearList(L);
printf("线性表已清空\n");
printf("线性表长度:%d\n",ListLength(L));
break;
case 10:
if(ListEmpty(L))
{
printf("kong\n")
}
break;
case 11:
DestroyList(L);
break;
}
}
