数据结构C语言版线性表源代码

1、#include#include#include#include#defineLIST_INIT_SIZE100#defineLISTINCREMENT10#defineOK1#defineERROR-1#defineOVERFLOW-1#defineENDFLAG0typedefintStatus;typedefintElemType;#defineOUTFORMAT%d#defineINFORMAT%dtypedefstructElemType*elem;intlength;intlistsize;SqList;StatusInitList(SqList*L)L-elem=(ElemTyp

2、e*)malloc(LIST_INIT_SIZE*sizeof(ElemType);if(!L-elem)/如果没有分配成功exit(OVERFLOW);/退出，显示()内内容L-length=0;L-listsize=LIST_INIT_SIZE;returnOK;StatusInputdata(SqList*L)/SqList*L定义首节点的地址ElemTypetemp,*newbase;printf(nInputthedataofthesequenciallist:nNote:0istheendingflag:n);scanf(INFORMAT,&temp);while(temp!=EN

3、DFLAG)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;L-elemL-length+=temp;scanf(INFORMAT,&temp);returnOK;StatusListInsert(SqList*L,inti,ElemTypee)ElemType*p,*q,*

4、newbase;if(iL-length)returnERROR;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-elemi-1);for(p=&(L-elemL-length-1);p=q;-p)*(p+1)=*p;*q=e;+L-length;returnOK;voidMyDisplay(Sq

5、ListL)inti;for(i=0;iL.length;i+)printf(OUTFORMAT,L.elemi);printf(n);voidmain(void)SqListL;ElemTypetemp;inti;if(!InitList(&L)/如果初始化失败printf(Toinitializethesequenciallistfailn);getch();/如果失败，按任意键退出exit(0);if(!Inputdata(&L)printf(Toinputthedataofthesequenciallistfailn);getch();exit(0);MyDisplay(L);printf(Inputthedatathatyouwanttoinsert:);scanf(INFORMAT,&temp);printf(Inputtheinsert_location:);scanf(%d,&i);