《数据结构线性表基本操作》由会员分享，可在线阅读，更多相关《数据结构线性表基本操作（7页珍藏版）》请在金锄头文库上搜索。
1、#include#include#include#defineTRUE1#defineFALSE0#defineOK1#defineERROR0#defineINFEASIBLE-1#defineOVERFLOW-2typedefint Status;typedefint ElemType;#define LIST_INIT_SIZE100#define LISTINCREMENT 10 typedef structElemType *elem;int length;int listsize;SqList;Status InitList_Sq(SqList *L);void DestroyLi
2、st_Sq(SqList *L);void ClearList_Sq (SqList *L);Status ListEmpty_Sq (SqList L);Status ListLength_Sq (SqList L);构造空的线性表销毁一个线性表/将L置为空表空表返回TRUE/返回元素个数Status GetElem_Sq (SqList L, int i, ElemType *e);用e返回第i个元素算法2.2中使用Status LocateElem_Sq(SqList L, ElemType e, Status (* compare)(ElemType, ElemType); /在L中找
3、到一个值与e满足compare()的元素的位序Status PriorElem_Sq(SqList L, ElemType cur_e, ElemType *pre_e);用pre_e返回cur_e的前驱Status NextElem_Sq(SqList L, ElemType cur_e, ElemType *next_e);用next_e返回cur_e的后继Status ListInsert_Sq(SqList *L, int i, ElemType e);/在第i位插入新的元素eStatus ListDelete_Sq(SqList *L, int i, ElemType *e);/删除
4、第i个元素用e返回算法2.3/构造空的线性表Status InitList_Sq(SqList *L)L-elem = (ElemType *)malloc(LIST_INIT_SIZE * sizeof(ElemType);if (! L-elem)printfC 构造失败!n);exit(OVERFLOW);L-length = 0;L-listsize = LIST_INIT_SIZE;printf(-构造成功！ n);return OK;void DestroyList_Sq(SqList *L)/ 销毁一个线性表if (L-elem != NULL)free (L-elem);L-e
5、lem = NULL;L-length = 0;L-listsize = 0;printf(已销毁线性表!n);void ClearList_Sq (SqList *L)/将 L 置为空表if(L-elem != NULL)L-length = 0;printf(已将 L 置为空表!n);Status ListEmpty_Sq (SqList L)/ 空表返回 TRUEif (L.elem != NULL)if (L.length = 0)printf(是空表n);return TRUE;elseprintf(不是空表 n);return FALSE;elseexit(ERROR);Statu
6、s ListLength_Sq (SqList L)/ 返回元素个数if (L.elem != NULL)return L.length;elsereturn ERROR;Status GetElem_Sq (SqList L, int i, ElemType *e)用 e 返回第 i 个元素 算法 2.2 中使用if (ListEmpty_Sq(L)printf(为空表!n);return ERROR;if (i L.length)printf(不存在地d个位置!n, i);return ERROR;*e = L.elemi - 1;return OK; /算法2.6/Status Loca
7、teElem_Sq(SqList L, ElemType e, Status (* compare)(ElemType, ElemType) 在L中找到一个值与e满足compare()的元素的位序int i = 1;int *p = L.elem;while (i = L.length & !(* compare)(*p +, e)+i;if (i = L.length)return i;elsereturn 0;/*指向函数的指针*/Status PriorElem_Sq(SqList L, ElemType cur_e, ElemType *pre_e)/用 pre_e 返回cur_e的前
8、驱 int i = 2;while (i = L.length)if (cur_e = L.elemi - 1)*pre_e = L.elemi - 2;return OK;i +;return ERROR;Status NextElem_Sq(SqList L, ElemType cur_e, ElemType *next_e)/ 用 next_e返回cur_e的后继 int i = 1;while (i L.length) if (cur_e = L.elemi - 1)*next_e = L.elemi;return OK;i +;return ERROR;/算法2.4在第i位插入新的元
9、Status ListInsert_Sq(SqList *L, int i, ElemType e)素eElemType *newbase, *p, *q;if (i L-length +1)return ERROR;if (L-length = L-listsize)newbase = (ElemType *)realloc(L-elem,(L-listsize + LISTINCREMENT)*sizeof(ElemType);if (! newbase)exit(OVERFLOW);L-elem = newbase;L-listsize += LISTINCREMENT;q = &(L-
10、elemi - 1);for (p = &(L-elemL-length - 1); p = q; p-)*(p + 1) = * p;*q = e;+L-length;return OK;/算法2.5用e返回Status ListDelete_Sq(SqList *L, int i, ElemType *e)删除第 i 个元素ElemType *p, *q;if (i L-length)return ERROR;p = &(L-elemi -1);*e = *p;q = L-elem + L-length - 1;for (+ p; p length;return OK ;Status ma
11、in(void)SqList L;ElemType i, n = 0, e = 0, cur_e = 0, pre_e = 0, next_e = 0;char ch;printf(初始化线性表-);InitList_Sq(&L);printf(是否销毁线性表L? YORN);ch = getchar();if (ch = Y)DestroyList_Sq(&L);return 0;elseClearList_Sq(&L);for (i = 1; i = LISTINCREMENT; i +)L.elemi - 1 = i;L.length +;printf(线性表内初始数值为:n);for
12、(i = 1; i = LISTINCREMENT; i +)printf(%4d, L.elemi - 1);printf(n);n = ListLength_Sq (L);printf(线性表内元素个数为3dn, n);printf(欲知道第i位数字i =);scanf(%d, &i);GetElem_Sq(L, i, &e);printf(第d 位数字为%dn, i, e);cur_e = e;PriorElem_Sq(L, cur_e, &pre_e);printf(%d 的前驱是%dn, cur_e, pre_e);NextElem_Sq(L, cur_e, &next_e);pri
13、ntf(%d 的后继是%dn, cur_e, next_e);printf(-请输入要插入的位数和要插入的数字:)；scanf(%d %d, &n, &e);ListInsert_Sq(&L, n, e);printf(插入后线性表内d个数据为:n, L.length);for (i = 1; i = L.length; i +)printf(%4d, L.elemi - 1);printf(n);ListDelete_Sq(&L, n, &e);printf(删除线性表中第d个数据d后，线性K%d个数据为:n, n, e, L.length);for (i = 1; i = L.length; i +)printf(%4d, L.elemi - 1);printf(n);return 0;
