动态顺序 线性表 的实现源码

    用c实现的顺序线性表，大部分源码来自于学校的教学资料，如果造成侵权，请作者联系我：）我进行了完善与部分修改，因水平有限，错误难免，随着以后功力的加深，还会不断进行修改完善。

/** Copyright (c) leo* All rights reserved.* filename: dslist.h* summary : 动态顺序线性表的类型和界面定义头文件* version : 1.0* author : leo* date : 6.08.2011*/#define TRUE 1#define FALSE 0#defineSPECIAL -1#define OVERFLOW -2/* 定义顺序表的大小。应根据需要修改 */enum { NBASE = 20 };/* 定义顺序表的元素类型。应根据需要修改 */typedef int DataType;struct SeqList { int n, /* 当前元素个数 n*/nmax; /* 存储区大小 nmax */ DataType *elems; /* 存放线性表中的元素 */};typedef struct SeqList *PSeqList;/* 创建新的空的顺序表 */PSeqList createNullList_seq( void );/*销毁线性表*/int destroyList(PSeqList palist);/*将线性表置为空表*/int clearList(PSeqList palist);/* 判断顺序表是否为空 */int isNullList_seq( PSeqList palist );/*返回线性表中数据元素个数*/int listLength_seq(PSeqList palist);/*在palist所指顺序表中下标为p的元素之前插入元素x*/int insert_seq(PSeqList palist, int p, DataType x);/*在palist所指顺序表中删除下标为ｐ的元素*/int delete_seq( PSeqList palist, int p );/*求x在palist所指顺序表中的下标*/int locate_seq(PSeqList palist, DataType x);/* 求palist所指顺序表中下标为p的元素值 */DataType retrieve_seq( PSeqList palist, int p );/*如果x是顺序表的元素，则返回它的前驱；否则，操作失败*/DataType priorElem(PSeqList palist, DataType x);/*如果x是顺序表的元素，则返回它的后继；否则，操作失败*/DataType nextElem(PSeqList palist, DataType x);

 

/** Copyright (c) leo* All rights reserved.* filename: dslist.h* summary : 动态顺序线性表的函数实现* version : 1.0* author : leo* date : 6.08.2011*/#include <stdio.h>#include <stdlib.h>#include "dslist.h"/* 创建新的空顺序表 */PSeqList createNullList_seq( void ) { PSeqList lp = (PSeqList)malloc(sizeof(struct SeqList)); if (lp != NULL) { lp->elems = (DataType*)malloc(sizeof(DataType)*NBASE); if (lp->elems) { lp->n = 0; /*空表长度为0 */ lp->nmax = NBASE; return lp; } else free(lp); }else{printf("Out of space!/n"); /*存储分配失败*/exit(OVERFLOW);} return NULL;}/*销毁线性表*/int destroyList(PSeqList lp){if(NULL != lp)free(lp);return TRUE;}/*将线性表置为空表*/int clearList(PSeqList lp){if(NULL != lp){lp->n = 0;lp->nmax =NBASE;lp->elems = (DataType*)realloc(lp->elems,sizeof(DataType)*NBASE);}return TRUE;}/*在palist所指顺序表中下标为p的元素之前插入元素x*/int insert_seq(PSeqList lp, int p, DataType x) { int q; if ( p < 0 || p > lp->n ) { /* 不存在下标为p的元素 */ printf("Index of seq-list is out of range! /n"); return FALSE; } if ( lp->n == lp->nmax ) { /* 存储区满 */ DataType *dp = /* 存储区扩大一倍 */ (DataType*)realloc(lp->elems, lp->nmax*2*sizeof(DataType)); if (dp == NULL) { /* 空间耗尽，原来元素还在原处 */ printf("Seq-list overflow!/n"); return FALSE; } lp->elems = dp; lp->nmax *= 2; } for(q = lp->n - 1; q >= p; q--) /* 插入位置及之后的元素均后移一个位置 */ lp->elems[q+1] = lp->elems[q]; lp->elems[p] = x; /* 插入元素x */ lp->n++; /* 元素个数加1 */ return TRUE;}/*在lp所指顺序表中删除下标为ｐ的元素*/int delete_seq( PSeqList lp, int p ) { int q; if (p < 0 || p > lp->n-1 ) { /* 不存在下标为p的元素 */ printf("Index of seq-list is out of range!/n "); return FALSE; } for(q = p; q < lp->n - 1; q++) /* 被删除元素之后的元素均前移一个位置 */ lp->elems[q] = lp->elems[q+1]; lp->n--;/* 元素个数减1 */ return TRUE;}/*求x在lp所指顺序表中的下标*/int locate_seq(PSeqList lp, DataType x) { int q; for ( q = 0; q < lp->n; q++ ) if (lp->elems[q] == x) return q; return -1;}/* 求lp所指顺序表中下标为p的元素值 */DataType retrieve_seq( PSeqList lp, int p ) { if ( p >= 0 && p < lp->n ) /* 存在下标为p的元素 */ return lp->elems[p]; printf("Index of seq-list is out of range./n "); return SPECIAL; /* 返回一个顺序表中没有的特殊值 */}/* 判断顺序表是否为空 */int isNullList_seq( PSeqList lp ) { return lp->n == 0;}/*返回线性表中数据元素个数*/int listLength_seq(PSeqList lp){if(lp != NULL)return lp->n;elsereturn -1;}/*如果x是顺序表的元素，则返回它的前驱；否则，操作失败*/DataType priorElem(PSeqList lp, DataType x){int p = locate_seq(lp, x);if(-1 == p || 0 == p){printf("No prior elem!/n");return SPECIAL;}return lp->elems[p-1];}/*如果x是顺序表的元素，则返回它的后继；否则，操作失败*/DataType nextElem(PSeqList lp, DataType x){int p = locate_seq(lp, x);if(-1 == p || lp->n == p){printf("No next elem!/n");}return lp->elems[p+1];}int main(){return 0;}  

 

======================================================================

以下是根据 清华版 数据结构 中的算法 实现的动态顺序 线性表

 

头文件：

/** Copyright (c) leo* All rights reserved.* filename: dsList.h* summary : 动态顺序线性表的类型和界面定义头文件* version : 1.0* author : leo* date : 6.09.2011*/#defineTRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SIZE 100 //线性表存储空间初始分配量#define LISTINCREMENT 10 //线性表存储空间分配增量typedef int Status;typedef int ElemType; typedef struct{ElemType *elem; //存储空间基址int length; //当前长度int listsize; //当前分配的存储容量（以sizeof(ElemType)为单位）}SqList;typedef SqList* pSqList;/*构造空的顺序线性表*/Status InitList(SqList &L);/*销毁顺序线性表*/Status DestroyList(SqList &L);/*清空顺序线性表*/Status ClearList(SqList &L);/*判断L是否为空，为空返回TRUE,否则返回FALSE*/bool ListEmpty(const SqList &L);/*返回L中数据元素的个数*/int ListLength(const SqList &L);/*用e返回L中第i个数据元素的值*/Status GetElem(const SqList &L, int i, ElemType &e);/*求e在L所指顺序表中的下标*/int LocateElem(const SqList &L, ElemType e);/*返回L中第一个与e满足关系compare()的数据元素的位序，若不存在返回-1*/int LocateElem(const SqList &L, ElemType e, Status (*compare)(ElemType e1, ElemType e2));/*若cur_e是L中的数据，且不是第一个，则用pre_e返回它的前驱，否则操作失败，pre_e无定义*/PriorElem(const SqList &L,ElemType cur_e, ElemType &pre_e);/*若cur_e是L中的数据，且不是最后个，则用next_e返回它的后继，否则操作失败，next_e无定义*/NextElem(const SqList &L, ElemType cur_e, ElemType &next_e);/*在L中第i个元素之前插入新的数据元素e，L的长度加1*/ListInsert(SqList &L, int i, ElemType e);/*删除L的第i个元素，并用e返回其值，L的长度减1*/ListDelete(SqList &L, int i, ElemType &e);/*依次对L的每个元素调用函数visit()，一旦visit()失败，操作失败*/ListTraverse(const SqList &L,Status (* visit)(ElemType e));

 

实现：

/** Copyright (c) leo* All rights reserved.* filename: dsList.cpp* summary : 动态顺序线性表的实现* version : 1.0* author : leo* date : 6.09.2011*/#include <stdio.h>#include <stdlib.h>#include <iostream>#include "dsList.h"using namespace std;/*构造空的顺序线性表*/Status InitList(SqList &L){L.elem = (ElemType *)malloc(sizeof(ElemType)*LIST_INIT_SIZE);if(!L.elem) exit(OVERFLOW);L.length = 0;L.listsize = LIST_INIT_SIZE;return OK;}//InitList/*销毁顺序线性表*/Status DestroyList(SqList &L){if(NULL != &L){free(L.elem);free(&L);}return OK;}//DestroyList/*清空顺序线性表*/Status ClearList(SqList &L){if(NULL != &L){L.length = 0;L.listsize = LIST_INIT_SIZE;L.elem = (ElemType*)realloc(L.elem, sizeof(ElemType)*LIST_INIT_SIZE);}return OK;}//clearList/*判断L是否为空，为空返回TRUE,否则返回FALSE*/bool ListEmpty(const SqList &L){return 0 == L.length;}//ListEmpty/*返回L中数据元素的个数*/int ListLength(const SqList &L){return L.length;}//ListLength/*用e返回L中第i个数据元素的值*/Status GetElem(const SqList &L, int i, ElemType &e){if(i>0 && i<=L.length){e = L.elem[i-1];return OK;}else{printf("Index of seq-list is out of range./n ");return ERROR;}}//GetElem/*求e在L所指顺序表中的下标*/int LocateElem(const SqList &L, ElemType e) { int i; for ( i = 0; i < L.length; i++ ) if (L.elem[i] == e) return i; return -1;}//LocateElem/*返回L中第一个与e满足关系compare()的数据元素的位序(0-L.length-1)，若不存在返回-1*/int LocateElem(const SqList &L, ElemType e, Status (*compare)(ElemType e1, ElemType e2)){int i = 0;ElemType *p = L.elem;while((i<L.length) && !(*compare)(*p++, e))++i;if(i < L.length)return i;elsereturn -1;}//LocateElem/*若cur_e是L中的数据，且不是第一个，则用pre_e返回它的前驱，否则操作失败，pre_e无定义*/Status PriorElem(const SqList &L,ElemType cur_e, ElemType &pre_e){int i = LocateElem(L, cur_e);if(-1 != i && 0 != i){pre_e = L.elem[i-1];return OK;}else{printf("No prior elem!/n");return ERROR;}}//PriorElem/*若cur_e是L中的数据，且不是最后个，则用next_e返回它的后继，否则操作失败，next_e无定义*/Status NextElem(const SqList &L, ElemType cur_e, ElemType &next_e){int i = LocateElem(L, cur_e);if(-1 != i && i != L.length){next_e = L.elem[i+1];return OK;}else{printf("No next elem! /n");return ERROR;}}//NextElem/*在L中第i个元素之前插入新的数据元素e，L的长度加1*/Status ListInsert(SqList &L, int i, ElemType e){if(i<1 || i>L.length+1){printf("Index of seq-list is out of range./n ");return ERROR;}if(L.length >= L.listsize){ElemType* newBase = (ElemType *)realloc(L.elem, L.listsize + sizeof(ElemType)*LISTINCREMENT);if(!newBase)exit(OVERFLOW);L.elem = newBase;L.listsize += LISTINCREMENT;}ElemType *q = &L.elem[i-1];for(ElemType *p=&L.elem[L.length-1]; p>=q; p--)*(p+1) = *p;*q = e;++L.length;return OK;}//ListInsert/*删除L的第i个元素，并用e返回其值，L的长度减1*/Status ListDelete(SqList &L, int i, ElemType &e){if(i<1 || i>L.length){printf("Index of seq-list is out of range./n ");return ERROR;}ElemType *q = &L.elem[i-1];e = *q;for(++q; q <= &L.elem[L.length-1]; q++)*(q-1) = *q;--L.length;return OK;}//LsitDelte/*依次对L的每个元素调用函数visit()，一旦visit()失败，操作失败*/Status ListTraverse(const SqList &L,Status (* visit)(ElemType e)){for(ElemType *p = L.elem; p <= &L.elem[L.length-1]; ++p)if(!(*visit)(*p))return ERROR;return OK;}//ListTraverse