我的數(shù)據(jù)結(jié)構(gòu)單鏈表int

1、 #include #include #includetypedefstructypestructlinknodeLinkListLinkList #include #include #includetypedefstructypestructlinknodeLinkListLinkListL= L-next=LinkListpLinkList)malloc(sizeof(LNode); f(請輸入第%d 個結(jié)點的值：,i); p-next=L-L-next=returnLinkListLinkList L=(LinkList)malloc(sizeof(LNode);LNode *p,*q=

2、L;for(i=1;inext!=p=p-GetLength(LinkListLNode*p=L; /*p 先指向頭結(jié)點n=0; /nwhile(p-next!=p=p-/preturnvoidShowList(LinkListL)if(L=|L-next=LinkListp= i = 0; /結(jié)點的序號 while(p-nextNULL)p=p-next; f(第%d個結(jié)點數(shù)據(jù)域的值為：%dn,ip-/iLNode*LocateElem1(LinkListif(L=NULL|L-next=NULL)return NULL;LNode*p=L; while(p-next!=NULL&jnext

3、=NULL)return NULL;LNode/eLNode*LocateElem2(LinkListL,ypeif(L=NULL|L-next=NULL)return NULL;LNodewhile(p-next!=NULL&p-data!=e) returnreturn/i前evoidInsertList1(LinkListL, LNode *p=L,*s;i,ypewhile(p-next!=NULL&jnext!=NULL&p-data!=p= p-if(p-data=/es=(LNodes-next = p-next;p-next=p= p-if(p-data=/es=(LNodes

4、-next = p-next;p-next=/e的結(jié)點不存在/evoidInsertList3(LinkListypeLinkListwhile(p-next!=NULL&p-dataq = p= p-sLinkList)malloc(sizeof(LNode); s-next=q-next=else /ivoidist1(LinkListi)LNode*p=L,*q; while(p-next!=NULL&jnext!=NULL&p-data!=e)/qq= p-else /evoidist2(LinkListL,ypee) LNode/p指向值為ewhile(p-next!=NULL&p-

5、data!=e)/q指向pp=p-if(p-data=e)q-next=p-next; free (p);else voidmain()1234567890在值為e結(jié)點之后在值為e結(jié)點之前LinkListL; LinkListp; ypedo scanf(%d, &num);switch(num) LinkListp; ypedo scanf(%d, &num);switch(num) L= ifelse L= ifelse case 3:case length=f(單鏈表的長度：%d。n,length); case p=LocateElem1(L,i); if (p=NULL)case 6:p=LocateElem2(L,e); if (p=NULL)case 6:p=LocateElem2(L,e); if (p=NULL)case 7:InsertList1(L,i,e);