顺序表建立及基本操作.docVIP

顺序表建立及基本操作 #includeiostream using namespace std; #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define OVERFLOW -2 typedef int Status; typedef int ElemType; #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 typedef struct { //结构体 ElemType *elem; int length; int listsize; }SqList; SqList Lx; Status InitList_Sq(SqList L) //分配空间 { L.elem=new ElemType[LIST_INIT_SIZE]; if(!L.elem)exit(OVERFLOW); L.length =0; L.listsize=LIST_INIT_SIZE; return OK; } Status ListInsert(SqList L,int i,ElemType e) //增加新元素 { int *q,*p;ElemType *newbase; if(i1 || iL.length+1) return ERROR; if(L.length=L.listsize) { newbase=new ElemType[L.listsize+LISTINCREMENT]; if(!newbase) exit(OVERFLOW); L.elem=newbase; 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 Listlength(SqList L) //长度 { int *p=L.elem; //判断线形表是否存在 while(p) { return (L.length); } } void show(SqList L,int i) //显示 { int j;ElemType k; cout顺序表显示如下:endl; for(j=0;ji-1;j++) { k=L.elem[j]; coutk-; } if(j==i-1 i0) { k=L.elem[j]; coutk; } coutendl; } void create(SqList L,int n) //输入元素 { int e; for(int i=0;in;i++) { cine; L.elem[i]=e; L.length=i+1; } } Status ListDelete_Sq(SqList L,int 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 Listxiugei(SqList L,int i,ElemType e) //修改 { if(i1 || iL.length) return ERROR; else { L.elem[i-1]=e; return OK; } } void shuru(SqList L1) //顺序表的创建 { int a; InitList_Sq(L1); cout请输入顺序表的长度：; cina; cout请输入顺序表的元素(共a个)endl; create(L1,a); show(L1,a); } void zengjia(SqList L1)