1、請編寫算法將這兩個單鏈問題描述假設有兩個按元素值遞增次序排列的線性表，均以單鏈表形式存儲。表歸并為一個按元素值遞減次序排列的單鏈表，并計算表長。要求利用原來兩個單鏈表的結點存放歸并后的單鏈表?；疽笥面準酱鎯Y構實現存儲#includestdafx.h#includeiostreamusingnamespacestd;structNodeintnum;Node*next;Node*Create()/創建單鏈表intn=0;Node*p1,*p2,*head;p1=p2=newNode;head=NULL;while(p1-num!=0)if(n=1)head=p1;elsep2-next=p

2、1;p2=p1;p1=newNode;cinp1-num;if(p1-numnum&p1-num!=0)coutvv重新輸入按遞增排序的單鏈表:n;cinp1-num;n+;p2-next=NULL;returnhead;voidPrint(Node*head)/輸出鏈表Node*p=head;while(p)coutnumnext;coutnext;while(q)r=q-next;q-next=p;p=q;q=r;head-next=NULL;head=p;returnhead;Node*MergeList(Node*head1,Node*head2)/合并單鏈表，降序if(head1=N

3、ULL)returnhead2;if(head2=NULL)returnhead1;Node*head;if(head1-num=head2-num)head=head1;head1=head1-next;elsehead=head2;head2=head2-next;Node*temp=head;while(head1!=NULL&head2!=NULL)if(head1-num=head2-num)temp-next=head1;head1=head1-next;temp=temp-next;elsetemp-next=head2;head2=head2-next;temp=temp-ne

4、xt;if(head1=NULL)temp-next=head2;if(head2=NULL)temp-next=head1;returnhead;intCount(Node*head)求表長Node*p=head;inti=0;while(p)i+;p=p-next;returni;intmain(intargc,char*argv)Node*p1,*p2;p1,p2=newNode;coutvv創建單鏈表1,遞增排序,0作為結束符！n;p1=Create();coutvv單鏈表1為n;Print(p1);J.-ft1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*

5、1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*z-/XI1I-11TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxcoutvv創建單鏈表2,遞增排序，0作為結束符！n;p2=Create();coutvv單鏈表2為：n;Print(p2);J.-ft1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*yzJ1T11TxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTxTx-*%coutvv合并單鏈表為(降序排列)：n;Node*p3;p3=MergeList(ReverseList