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

运行闪退，怎么解决

#include

#include

#define error -1

#define ok 1

#define maxsize 10

typedef int elemtype;

typedef int status;

typedef struct

{

elemtype *array;

int length;

}SqList;

status Init_sqlist(SqList *L)

{

L->array=(elemtype*)malloc(maxsize*sizeof(elemtype));

if(!L->array)

return error;

else

{

L->length=0;

return ok;

}

}

status Insert_sqlist(SqList *L,int i,elemtype e)

{

int j;

if(i<1||i>L->length-1)

return error;

if(L->length>=maxsize)

{

printf("线性表yichu\n");

return error;

}

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

L->array[j+1]=L->array[j];

L->array[i-1]=e;

L->length++;

return ok;

}

status Delete_sqlist(SqList *L,int i,elemtype *e)

{

int k;

if(i<1||i>L->length-1)

{

printf("要删除的元素不存在\n");

return error;

}

if(L->length==0)

{

printf("线性表空\n");

return error;

}

*e=L->array[i-1];

for(k=i-1;klength-1;k++)

L->array[k]=L->array[k+1];

L->length--;

return ok;

}

status Located_sqlist(SqList *L,elemtype m)

{

int h=0;

while(hlength)

{

if(L->array[h]!=m)

h++;

if(L->array[h]==m)

printf("元素所在%d个\n",h+1);

}

if(h>=L->length)

{

printf("要查找的元素不存在\n");

return error;

}

return ok;

}

status Pri_sqlist(SqList*L)

{

int f;

for(f=0;flength;f++)

printf("%d ",L->array[f]);

return ok;

}

int main(void)

{

int i,n,a,b;

SqList *L;

elemtype *e;

for(i=0;i

scanf("%d",L->array[i]);

printf("插入1\n");

printf("删除2\n");

printf("打印3\n");

printf("查找4\n");

Init_sqlist(L);

while(n)

{

scanf("%d",&n);

switch(n)

{

case 1:printf("输入要插入的要素:\n");

scanf("%d",&a);

printf("输入要插入的位置:\n");

scanf("%d",&b);

Insert_sqlist(L,b,a);

break;

case 2:printf("请输入要删除的元素:\n");

scanf("%d",&a);

Delete_sqlist(L,a,e);

break;

case 3:Pri_sqlist(L);

break;

case 4:printf("请输入要查找的元素:\n");

scanf("%d",&a);

Located_sqlist(L,a);

break;

}

}

return 0;

}