线性表的完整程序数据结构C语言版

1、#ifndef SEQLIST #defi ne SEQLIST #include <stdlib.h>/*顺序表存储空间长度的最小值*/#define LISTMINSIZE 10/*顺序表存储结构类型定义*/typedef structListDT *base;/*顺序表空间基地址*/int listsize;/*顺序表空间尺寸*/int len;/*顺序表长度*/SeqList;/*顺序表初始化*/void ListI nitialize(SeqList *pL, int size)if(sizevLISTMINSIZE)size=LISTMINSIZE;/*限定不能小于最小

2、尺寸*/pL->listsize=size;pL->base=(ListDT *)malloc(pL->listsize*sizeof(ListDT); if(!pL->base)exit(EXIT_FAILURE);pL->len =0;/*初始化空表*/*按给定的下标取顺序表元素值*/BOOL ListElem(SeqList L, int index, ListDT *pelem)BOOL flg=TRUE;if(in dex<0 | in dex>L.le n-1 ) flg=FALSE;/*参数越界 */else*pelem=L.basei

3、ndex;return flg;/*求顺序表长度*/int ListLe n( SeqList L) return L.le n;/*在顺序表中指定序号位置插入元素*/BOOL Listl nsert(SeqList *pL, i nt pos, ListDT d)BOOL flg=TRUE;int i;if(pos<0 | pL->le n>=pL->listsize | pos>pL->le n) flg=FALSE;elsefor(i=pL->le n-1; i>=pos; i-) pL->basei+1=pL->basei;p

4、L->basepos=d;pL->le n+;return flg;/*把顺序表中指定序号的元素删除*/BOOL ListDel(SeqList *pL, i nt pos)BOOL flg=TRUE;int i;if(pos<0 | pos>=pL->le n) flg=FALSE;elsefor(i=pos+1; i<pL->le n; i+) pL->basei-1=pL->basei; pL->le n-;return flg;/*移动数据*/*写入数据*/*表长增1*/*移动数据*/*表长增1*/*在顺序表中查找元素*/in

5、t ListLoc(SeqList L, ListDT d,BOOL (*equal)(ListDT, ListDT) int pos=Len-1;while(pos>=0 && !(*equal)(L.basepos,d)pos-;return pos;/*取前导元素序号位置*/BOOL ListPrior(SeqList L, int pos, int *ppriorpos) BOOL flg=TRUE;if(pos>0 && pos<L.le n)*ppriorpos=pos-1;elseflg=FALSE;return flg;/*取后

6、继元素序号位置*/BOOL ListNext(SeqList L, int pos, int *pn extpos) BOOL flg=TRUE;if(pos>=0 && pos<L.le n-1)*pn extpos=pos+1;elseflg=FALSE;return flg;/*销毁顺序表*/void ListDestroy(SeqList L)free(L.base); #en dif/*建议性测试用程序*/typedef en um TRUE=1,FALSE=0 BOOL; typedef int ListDT;#in clude "seqlis

7、t.c"void prin tSeqList(SeqList L)int i;ListDT x;prin tf("nList:n");for(i=0; ivListLen(L); i+)ListElem(L,i, &x); prin tf("%3d",x);BOOL dataequal(int x, int y)return (x=y)? TRUE:FALSE;#defi ne N 5void mai n()int i,prior, next;ListDT x,testN=10,20,30,40,50;SeqList L;/*初始化顺序

8、表*/ListI ni tialize(&L,N);/*在表头插入N个元素*/for(i=0; i<N; i+)ListI nsert(& L,0,testi); prin tSeqList(L);/*删除元素*/ListDel(&L,N/2);prin tSeqList(L); prin tf("nin put a key: n");scan f("%d", &x);/*查找x在表中位置*/i=ListLoc(L,x,dataequal);/*求x的前导元素*/ if(ListPrior(L,i,&prior)ListElem(L,prior, &x); prin tf("Prior:%dn",x); elseprintf("no Prior.'n");/*求x的后继*/if(ListNext(L,i,&n ext)ListElem(L, next，& x); prin tf("Next