实验一 线性表的存储结构 实验代码及运行截图.doc

线性表的存储结构 实验代码及运行截图#define LIST_INIT_SIZE 20 /线性表存储空间的初始分配量#define LISTINCREMENT 10 /线性表存储空间的分配增量#includestdio.h#includestdlib.htypedef structint *elem; /当前空间基址int length; /当前长度int listsize; /当前分配的存储容量SqList;SqList L;int InitList_sq(SqList &L) L.elem=(int*)malloc(LIST_INIT_SIZE *sizeof(int);if(!L.elem)exit(0);L.length=0;L.listsize=LIST_INIT_SIZE;return 1;int ListInsert_sq(SqList &L,int i,int e) int *p,*q;int *newbase;printf(输入插入位置:n);scanf(%d,&i);if(iL.length+1)return 1; if(L.length=L.listsize) newbase=(int*)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(int);if(!newbase)return(0); L.elem=newbase; L.listsize+=LISTINCREMENT; printf(输入插入元素:n);scanf(%d,&e);q=&(L.elemi-1); for(p=&(L.elemL.length-1);p=q;-p)*(p+1)=*p; *q=e; +L.length; return 1;int ListDelete_sq(SqList &L,int i) int *p,*q;printf(输入删除位置:n); scanf(%d,&i);if(iL.length)return(0); p=&(L.elemi-1); q=L.elem+L.length-1; for(+p;p=q;+p)*(p-1)=*p; -L.length; return 1;int Listfind_sq(SqList &L,int i) int p;if (!L.elem | L.length L.listsize) printf(Empty!n); return 0; printf(输入查找元素位置:n); scanf(%d,&i);if(iL.length) return(0); elsep=(L.elemi-1);printf(查找的元素为:n);printf(%dn,p);return 1;int Listinput(SqList &L,int a)printf(输入元素(输入-1跳出):n);while(1) scanf(%d,&a);if(a=-1)break;L.elemL.length= a ; L.length+; return 1;int ListPrint(SqList &L) int i; if (!L.elem | L.length L.listsize) printf(Empty!n); return 0; for (i = 0; i L.length; i+) printf(%d , L.elemi); printf(n); return 1;void main() /主函数int a,i,e,j; while(1)printf(*n);printf(tttt 线性表tttt*nn);printf( 建立线性表 tt 输入数据 n);printf( 插入数据 tt 删除数据 n);printf( 查找数据 ttt 显示数据 n);printf( 退出 ttttt n);printf(请输入操作键(1-7):);scanf(%d,&j);switch(j)case 1:InitList_sq(L);printf(建表成功!nnn);break;case 2:if(!InitList_sq(L)break;Listinput(L, a);ListPrint(L);break; case 3:ListInsert_sq(L, i, e);ListPrint(L);break; case 4:ListDelete_sq(L, i); ListPrint