顺序线性表基本操作.docx

//顺序线性表#includeiomanip#includeiostream#include stringusing 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 struct{elemtype *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(i1||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.elem[i-1]);for(p=(L.elem[L.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(i1||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 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;cout请输入元素个数:\n;cinn;cout请输入元素:\n;for(i=0;in;i++)cinL.elem[i];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表为空\n\n;else{for(i=0;iL.length;i++)coutsetw(5)L.elem[i];coutendlendl;return OK;}return 0;}void insert(sqlist L){elemtype j,k;cout请输入要插入的位置和该元素:\n;cinjk;if(insertlist_sq(L,j,k))// 调用插入函数cout插入成功!\n\n;elsecout插入失败!\n\n;}void del(sqlist L){elemtype i,e;cout请输入要删除元素的位置:\n;cini;if(dellist_sq(L,i,e)==1)//调用删除函数cout删除成功!删除的元素为:eendlendl;elsecout删除失败!\nendl;}void chazhao(sqlist L) {elemtype e,k;cout请输入要查找的元素:\n;cine;k=Locateelem_sq(L,e);//调用查找函数if(k)coute是表中的第k个元素endlendl