数据结中顺序表的基本操作.docVIP

//头文件 #includestdio.h #includemalloc.h #includestdlib.h //函数返回状态代码 #define OK 1 #define ERROR 0 #define TRUE 1 #define FALSE 0 #define INFEASIBLE -1 #define OVERFLOW -2 //运用动态分配的顺序存储结构 #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 typedef int ElemType; typedef struct{ ElemType *elem; int length; int listsize; }SqList; typedef int Status; Status InitList(SqList L){ //初始化一个顺序表 L.elem=(ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType)); if(!L.elem) exit(OVERFLOW); L.length=0; L.listsize=LIST_INIT_SIZE; return OK; }//InitSqList Status ListInsert(SqList L,int i,ElemType e){ //在第i个元素前插入一个新的元素 if(i1 || i ++L.length) return ERROR; if(L.length==L.listsize) { ElemType * newbase=(ElemType *)realloc(L.elem,(LIST_INIT_SIZE+LISTINCREMENT)*sizeof(ElemType)); if(!newbase) exit(OVERFLOW); L.elem=newbase; L.listsize=LIST_INIT_SIZE+LISTINCREMENT;//勿忘 } for (int j=L.length; j=i; --j)//此处要注意 L.elem[j]=L.elem[j-1]; L.elem[i-1]=e; return OK; }//ListInsert Status GetElem(SqList L,int i,ElemType e){ //返回顺序表中的第i个元素 if(i1||iL.length) return ERROR; e=L.elem[i-1]; return OK; }//GetElem Status ListDelete(SqList L,int i,ElemType e){ //删除顺序表中的第i个元素 if(i1||iL.length) return ERROR; e=L.elem[i-1]; for(i;iL.length;i++) L.elem[i-1]=L.elem[i]; --L.length; return OK; }//ListDelete Status PriorElem(SqList L,ElemType cur_e,ElemType pre_e){ //返回一个不是首元素的前驱 int i=2; if(cur_e==L.elem[0]) return ERROR; while(i=L.length(L.elem[i-1]!=cur_e)) i++; if(i==L.length+1) return ERROR; else pre_e=L.elem[i-2]; return OK; }//PriorElem Status NextElem(SqList L,ElemType cur_e,ElemType next_e){ //返回一个不是末元素的后继 int i=1; while(iL.length(L.elem[i-1]!=cur_e)) i++; if(i==L.length) return ERROR; else next_e=L.elem[i]; return OK; }//NextElem Status ListEmpty(SqList L){ //判断顺序表是否为空 return L.length