顺序线性表基本操作.doc

/顺序线性表#include#include#include using namespace std;#define LIST_SIZE 10#define LISTINCREMENT 2#define OVERFLOW -2#define OK 1#define ERROR 0typedef int Bool;typedef int elemtype;typedef int status;typedef structelemtype *elem;int length;int listsize;sqlist;status initlist_sq(sqlist &L) / 创建一个空表 L.elem=(elemtype *)malloc(LIST_SIZE*sizeof(elemtype);if(!L.elem)exit(OVERFLOW);L.length=0;L.listsize=LIST_SIZE;return OK;status insertlist_sq(sqlist &L,int i,elemtype e) / 插入元素elemtype *p,*q;if(iL.length+1)return ERROR;if(L.length=L.listsize)L.elem=(elemtype *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(elemtype);if(!L.elem)exit(OVERFLOW);L.listsize+=LISTINCREMENT;q=&(L.elemi-1);for(p=&(L.elemL.length-1);p=q;p-)*(p+1)=*p;*q=e;L.length+;return OK;status dellist_sq(sqlist &L,elemtype i,elemtype &e)/ 删除元素elemtype *p,*q;if(iL.length)return ERROR;p=&(L.elemi-1);e=*p;q=L.elem+L.length-1;for(p+;p=q;p+)*(p-1)=*p;L.length-;return OK;status Locateelem_sq(sqlist L,elemtype e)/ 查找元素int i;elemtype *p;i=1;p=L.elem;for(;i=L.length;i+,p+)if(*p=e)return i;return ERROR;void mainn(void) cout请选择需要的操作:n1:创建线性表n2:显示线性表n3:插入元素n4:删除元素n5:查找元素n6:退出n;void build(sqlist &L) if(!initlist_sq(L)exit(OVERFLOW);void shuru(sqlist &L) / 输入数据int i,n;coutn;cout请输入元素:n;for(i=0;iL.elemi;L.length=n;cout建立线性表成功!endlendl;int empty(sqlist L) / 判断表是否为空if(L.length=0)return OK;elsereturn ERROR;status shuchu(sqlist L) / 遍历输出int i;if(empty(L)cout表为空nn;elsefor(i=0;iL.length;i+)coutsetw(5)L.elemi;coutendlendl;return OK;return 0;void insert(sqlist &L) elemtype j,k;coutjk;if(insertlist_sq(L,j,k)/ 调用插入函数cout插入成功!nn;elsecout插入失败!nn;void del(sqlist &L) elemtype i,e;couti;if(dellist_sq(L,i,e)=1)/调用删除函数cout删除成功!删除的元素为:eendlendl;elsecout删除失败!nendl;void chazhao(sqlist L) elemtype e,k;coute;k=Locateelem_sq(L,e);/调用查找函数if(k)coute是表中的第k个元素endlendl;elsecoute不是表中的元素endli;if(i=6) break;switch(i) case 1:shuru(L);break;case 2:shuchu(L);break;case 3:insert(L);break;case 4:del(L);break;case 5:chazhao(L);break