#include<stdio.h>
using namespace std;
#define ok 0
#define error -1
#define max 9
typedef char typeelem;
typedef int status;
typedef struct no
{
typeelem *elem;
int len;
} sqlist;
status initlist(sqlist &L);//构造一个空的线线性表操作
status shuzhi(sqlist &L);
status quezhi(sqlist &L, typeelem &e);
status bianli(sqlist L);
status listinsert(sqlist&L , typeelem &a);
//status clearlist(sqlist &L, typeelem &b);
status dstroylist(sqlist &L);
//status listempt(sqlist L);
int main()
{
sqlist L;
typeelem e;
typeelem a;
initlist(L);
shuzhi(L);
quezhi(L, e);
bianli(L);
cout << e << endl;
cout << "\b请输入要插入的值a" << endl;
cin >> a;
listinsert(L, a);
bianli(L);
//clearlist(L, b);
dstroylist(L); //bianli(L);
return ok;
}
status initlist(sqlist &L)
{
L.elem = new typeelem[max];
if(!L.elem)
{
cout << "\b开劈失败" << endl;
return error;
}
else
{L.len = max - 1;}
}
status shuzhi(sqlist &L)
{
int i;
for (i = 1; i<=L.len; i++)
{
cin >>L.elem[i];
}
return ok;
}
status quezhi(sqlist &L, typeelem &e)
{
int i;
cout << "\b请输入要取出几号元素0-(max-1)" << endl;
cin >> i;
e = L.elem[i];
return ok;
}
status bianli(sqlist L)
{
cout << "\b现在开始遍历整个线性表" << endl;
int i;
if(!L.elem)
{
cout << "表空" << endl;
return error;
}
else
for (i = 1; i<=L.len; i++)
{
cout << L.elem[i] << endl;
}
return ok;
}
status listinsert(sqlist &L, typeelem &a)//插入元素的操作
{
int i;
int j;
cin >> i;
if(i<1||i>L.len+1)
{
cout << "\b输入不存在" << endl;
return error;
}
cout << "\b请输入要插入的元素" << endl;
for (j = L.len+1; j>i; j--)//原数组空间分配了9个空间，只用了8个
L.elem[j] = L.elem[j-1];/*这里队j可以理解为指针一样的东西，假设我要在第6个数组空间插入元素，需要把第6个空间置空，把6
以后空间的值依次往后移（包括6）*/
L.elem[i] = a;
L.len++;
return ok;
}
status dstroylist(sqlist &L)
{
if(L.elem)
{
delete[] (L.elem);
L.elem = NULL;
L.len = 0;
return ok;
}
else {
cout << "表不存在" << endl;
return error;
}
}
/*status clearlist(sqlist &L, typeelem &b)//清空顺序表
{
L.elem = NULL;//原本开辟的是数组空间，要清空表只需保留指针，使数组空间为空
return ok;
}*/
求大神解答为什么destroylist函数中delete会报trace/breakpoint trap错误
