1、第第 #頁structLNode1*next;/*指向后繼結點*/LinkList1;voidInitList(SqList*&L)L=(SqList*)malloc(sizeof(SqList);/*分配存放線性表的空間*/L-length=0;voidInitList1(LinkList1*&L)L=(LinkList1*)malloc(sizeof(LinkList1);/*創建頭結點*/L-next=NULL;voidCreateList(SqList*&L,ElemTypea,intn)/*建立順序表*/inti;for(i=0;idatai=ai;L-length=n;voidCr

2、eateListR(LinkList1*&L,ElemTypea,intn)/*尾插法建立單鏈表*/LinkList1*s,*r;inti;L=(LinkList1*)malloc(sizeof(LinkList1);/*創建頭結點*/L-next=NULL;r=L;/*r始終指向終端結點,開始時指向頭結點*/for(i=0;idata=ai;r-next=s;/*將*$插入*r之后*/r=s;r-next=NULL;/*終端結點next域置為NULL*/voidDispList(SqList*L)inti;if(L-length=0)return;for(i=0;ilength;i+)pri

3、ntf(%c,L-datai);printf(n);voidDispListl(LinkListl*L)LinkListl*p=L-next;while(p!=NULL)printf(%c,p-data);p=p-next;printf(n);/順序表存放有序表voidUnionList(SqList*LA,SqList*LB,SqList*&LC)inti=0,j=0,k=0;/*i、j、k分別作為LA、LB、LC的下標*/LC=(SqList*)malloc(sizeof(SqList);LC-length=0;while(ilength&jlength)if(LA-dataidataj)

4、LC-datak=LA-datai;i+;k+;else/*LA-dataiLB-dataj*/LC-datak=LB-dataj;j+;k+;while(ilength)/*LA尚未掃描完,將其余元素插入LC中*/LC-datak=LA-datai;i+;k+;while(jlength)/*LB尚未掃描完,將其余元素插入LC中*/LC-datak=LB-dataj;j+;k+;LC-length=k;/單鏈表存放有序表voidUnionList1(LinkList1*LA,LinkList1*LB,LinkList1*&LC)LinkList1*pa=LA-next,*pb=LB-next

5、,*pc,*s;LC=(LinkList1*)malloc(sizeof(LinkList1);/*創建LC的頭結點*/pc=LC;/*pc始終指向LC的最后一個結點*/while(pa!=NULL&pb!=NULL)if(pa-datadata)s=(LinkListl*)malloc(sizeof(LinkListl);/*復制*pa結點*/s-data=pa-data;pc-next=s;pc=s;/*采用尾插法將*s插入到LC的最后*/pa=pa-next;elses=(LinkList1*)malloc(sizeof(LinkList1);/*復制*pb結點*/s-data=pa-d

6、ata;pc-next=s;pc=s;/*采用尾插法將*s插入到LC的最后*/pa=pa-next;while(pa!=NULL)s=(LinkListl*)malloc(sizeof(LinkListl);/*復制*pa結點*/s-data=pa-data;pc-next=s;pc=s;/*采用尾插法將*s插入到LC的最后*/pa=pa-next;while(pb!=NULL)s=(LinkList1*)malloc(sizeof(LinkList1);/*復制*pa結點*/s-data=pb-data;pc-next=s;pc=s;/*采用尾插法將*s插入到LC的最后*/pb=pb-nex

7、t;pc-next=NULL;voidUnion()SqList*L1,*L2,*L3;LinkList1*L4,*L5,*L6;ElemTypea5;ElemTypeb5;printf(a=:);scanf(%s,a);printf(b=:);scanf(%s,b);printf(順序表存放有序表的合并n);InitList(L1);InitList(L2);InitList(L3);CreateList(L1,a,3);printf(L1:);DispList(L1);CreateList(L2,b,4);printf(L2:);DispList(L2);printf(歸并n);Union

8、List(L1,L2,L3);printf(L3:);DispList(L3);printf(單鏈表存放有序表的合并n);InitList1(L4);InitList1(L5);InitList1(L6);CreateListR(L4,a,3);printf(L4:);DispList1(L4);CreateListR(L5,b,4);printf(L5:);DispList1(L5);printf(歸并n);UnionList1(L4,L5,L6);printf(L6:);DispList1(L6);/彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳

9、、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、/猴子選大王/數到密碼數字的猴子退出、直到最后一只猴子usingnamespacestd;intMonkey()printf(n*n);printf(*猴子選大王*)printf(n*nn);intmonkey,pass,step=0,index=0,cir=0,t;printf(共有幾只猴子：)；scanf(%d,&monkey);printf(密碼數字：)；scanf(%d,&pass)；char*out=(char*)malloc(monkey)；if(!out)/沒有猴子時，返回-1return-1；memset(o

10、ut,0,monkey)；/對out進行清零操作while(1)if(step=monkey)break；while(cirpass)if(!outindex)+cir；index=(index+1)%monkey；cir=0；+step；out(index+monkey-1)%monkey=1；coutendlNo.(!index?monkey:index)out.；free(out)；/釋放ooutcoutendl；return0；/彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳

11、、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、彳、voidmenu()printf(nnttt主菜單tt);printf(nn);printf(t*printf(t*ttl.成績管理系統tt*n);printf(t*tt2.各種排序tt*n);printf(t*tt3.建立二叉樹tt*n);printf(t*tt4.有序表的合并tt*n);printf(t*tt5.猴子選大王tt*n);printf(t*tt6.退出tt*n);.J/*XItJII、FTWTTfTtf，T叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、叫、1voidmain()intm;menu();doprintf(ntt輸入您的選擇(15):);scanf(%d,&m);while(m6);for(;)/*循環無限次*/switch(m)case1:system(cls);ScoreManage();break;case2:system(cls);S