關(guān)于線(xiàn)性表的各種操作.doc

線(xiàn)性表的基本操作針對(duì)清華大學(xué)出版數(shù)據(jù)結(jié)構(gòu)#include #include typedef int Status;typedef int ElemType;#define TRUE 1#define OK 1#define OVERFLOW -2#define ERROR 0#define FALSE 0/線(xiàn)性表的順序存儲(chǔ)結(jié)構(gòu)#define LIST_INIT_SIZE 100 /線(xiàn)性表存儲(chǔ)空間的初始分配量#define LISTINCREMENT 10 /線(xiàn)性表存儲(chǔ)空間的分配增量typedef structElemType* elem;/線(xiàn)性表的存儲(chǔ)基址int length;/線(xiàn)性表當(dāng)前長(zhǎng)度int listsize;/當(dāng)前分配的存儲(chǔ)容量SqList;/構(gòu)造一個(gè)新的線(xiàn)性表Status Initlist_Sq(SqList &L)L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType);if(!L.elem)return OVERFLOW;/存儲(chǔ)分配失敗L.length=0;/初始空表長(zhǎng)度為零L.listsize=LIST_INIT_SIZE;/初始存儲(chǔ)容量return OK;/線(xiàn)性表的插入Status ListInsert_Sq(SqList &L,int i,ElemType e)/在線(xiàn)性表的第i個(gè)元素之前插入新的元素e /i的合法值為a1=i=L.length+1if(iL.length+1)return ERROR;if(L.listsize=LIST_INIT_SIZE)/當(dāng)前存儲(chǔ)空間已滿(mǎn)增加容量L.elem=(ElemType*)realloc(L.elem,(LIST_INIT_SIZE+LISTINCREMENT)*sizeof(ElemType);if(!L.elem)return OVERFLOW;L.listsize+=LISTINCREMENT;ElemType* p=&(L.elemi-1);ElemType* q;for(q=&(L.elemL.length-1);q=p;q+)*(q+1)=*q;*p=e;L.length+=1;return OK;/線(xiàn)性表的刪除Status ListDelete_Sq(SqList &L,int i,ElemType &e)/刪除線(xiàn)性表中第i個(gè)值，并用e返回其值 /i的合法值為a1=i=L.lengthif(iL.length)return ERROR;e=L.elemi-1;ElemType* p=&(L.elemi-1);ElemType* q=&(L.elemL.length-1);for(+p;pnext=NULL;for(i=n;i0;i-)p=(LinkList)malloc(sizeof(LNode);printf(輸入第%d個(gè)元素的值n,n);scanf(%d,&(p-data);p-next=NULL;L-next=p;/單鏈表數(shù)據(jù)元素的獲取Status GetElem_L(LinkList L,int i,ElemType &e)/當(dāng)?shù)趇個(gè)值存在時(shí)，賦值給e并返回OK，否則返回ERRORLinkList p;p=L-next;int j=1;while(p&jnext;j+;if(!p|ji)return ERROR;e=p-data;return OK;/單鏈表的插入Status ListInsert_L(LinkList &L,int i,ElemType e)/在帶頭結(jié)點(diǎn)的單鏈線(xiàn)性表的第i個(gè)元素前插入元素eLinkList p;int j=1;p=L;while(p&jnext;j+;/尋找第i-1個(gè)結(jié)點(diǎn)if(!p|ji)return ERROR;LinkList q=(LinkList)malloc(sizeof(LNode);q-data=e;q-next=p-next;p-next=q;return OK;/單鏈表的刪除Status ListDelete_L(LinkList &L,int i,ElemType &e)/在單鏈表L中刪除第i個(gè)元素并用e返回其值LinkList p;int j=1;p=L;while(p&jnext;