C抽象数据类型线性表及实现源代码.docVIP

//*******抽象数据类型线性表的实现***********// //*************************JXN/2010/10/23/****// #includeiostream.h #includeconio.h #includemalloc.h #includestdlib.h #includestdio.h #define FALSE 0; #define ERROR 0; #define OK 1; #define TURE 1; typedef int Status; //*******线性表的动态分配顺序存储结构******// #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 typedef int ElemType; typedef struct{ ElemType *elem; int length; int listsize; }SqList; Status InitList(SqList L) //**************构造 { L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType)); if(!L.elem) coutOVERFLOWendl,exit(0);//Exit L.length=0; L.listsize=LIST_INIT_SIZE; return OK; } Status DestroyList(SqList *L) //销毁 { if (L-elem) free(L-elem); return OK; } Status ClearList(SqList L) //重置 { L.length=0; return OK; } Status ListEmpty(SqList L) //判空 { if(L.length==0)return TURE; return FALSE; } Status ListLength(SqList L) //长度 { int Len=L.length; return Len; } Status GetElem(SqList L,int i,int e) //返 e { if(iL.length) { e=L.elem[i-1]; return OK; } else return ERROR; } Status LocateElem(SqList L,int e,int(* compare)(int a,int b))//比较 { for(int i=0;iL.length;i++) if(compare(e,L.elem[i])) return i; return -1; } Status PriorElem(SqList L,int cur_e,int pre_e) //前驱 { for(int i=1;iL.length;i++) if(L.elem[i]==cur_e) { pre_e=L.elem[i-1]; return OK; } return ERROR; } Status NextElem(SqList L,int cur_e,int next_e) //后继 { for(int i=0;iL.length-1;i++) if(L.elem[i]==cur_e) { next_e=L.elem[i+1]; return OK; } return ERROR; } Status ListInsert(SqList L,int i,int e) //插入 { if(i0||iL.length) return ERROR; if(L.length==L.listsize) { int * newbase = (int *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(int)); if(!newbase) return ERROR; L.elem = newbase; L.listsize += LISTINCREMENT; } int *q = (L.elem[i]); for(int *p=(L.elem[L.length]);pq;--p) *(p+1)=*p;