实验一：线性表操作数据结构系统上实验代码

《实验一：线性表操作数据结构系统上实验代码》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、#include#include#defineOK1#defineERROR0#deiineLIST_INIT_SIZE100#defineLISTINCREMENT10#defineElemT^peinttypeclefstruct{int*elem,length,listsize;}SqList;intInitList_Sq(SqList&L){L.eleni=(EIemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType));L.length=0;L.listsize=LIST_IN

2、IT_SIZE;returnOK;}intLoad_Sq(SqList&L){inti;if(L.length==O)printf(MTheListisempty!");else{printf(nTheListis:n);for(i=0;i

3、

4、i>L.length+l)returnERROR;ElemType*newbase,*q^*p;if(LJeng

5、th>=LJistsize)newbase=(EIemrI,pe*)realloc(L.elem,(L.listsize+LISTlNCREMENT)*sizeof(ElemrI,pe));L.eleni=newbase;[,.listsize+=LISTINCREMENT;}q=&(L.elem

6、i-ll);for(p=&(L.eIem[L.length-1])；p>=q；—p)*(p+l)=*p;*q=e;++L.length;returnOK;}intListDelete_Sq(SqList&LJnti,int&e){Elemiype*q,*p;if

7、(i

8、

9、i>L.length)returnERROR;p=&(L>elem[i-1]);e=*p;q=L.elem+L.length-l;for(++p;p<=q;p++)*(p-l)=*p;[^.length-;returnOK;}intniain(){SqListT;intaj;ElemTypee,x;if(InitListJSq(T)){printf(MASequenceListHasCreatedAn11);}while(X){printf(Hl:Insertelement2:DeleteeIement3:LoadalleIements

10、O:ExitPIeasechoose:'】】");scanf(H%d*',&a);switch(a){case1:scanf(f,%d%df&h&x);if(!ListInsertjSq(T4,x))printfC/lnsertError!H);elseprintf(MTheElement%disSuccessfullyInserted!*x);break;case2:scanf「％d'',&i);if(!ListDelete_Sq(T4,e))printf(f,DeleteError!H);elseprintf(HTheElement%d

11、isSuccessfullyDeleted!fe);break;case3:Load_Sq(T);break;case0:return1;}}}222222222222222222222222222222222222222222222222222222222222222222222222222222#include#include#defineOK1#defineERROR0#defineLIST_INIT_SIZE100#defineLISTINCREMENT10#defineElemTj-peinttypedef

12、struct{int*elemjengthjistsize;JSqList;intInitList_Sq(SqList&L){I,.elem=(ElemType*)malloc(LISTJNIT-SIZE*sizeof(Eleml>pe));L.length=0;L.listsize=LIST_INIT_SIZE;returnOK;}intLoad_Sq(SqList&L){inti;for(i=0;i

13、tL){returnL.length;