算法2.12

//已知單鏈線性表La和Lb的元素按值非遞減排列

//歸并La和Lb得到新的單鏈線性表Lc,Lc的元素也按值非遞減排列

void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc)

{

     pa=La->next;

     pb=Lb->next;

     Lc=pc=La;  //用La的頭節點作為Lc的頭節點

     while(pa&&pb)

     {

          if(pa->date <= pb->date)

          {

               pc->next=pa;//pc指針指向pa

               pc=pa;//pc元素等于pa

               pa=pa->next;//指向下一個節點,循環此過程

          }

          else

          {

               pc->next=pb;

               pc=pb;

               pb=pb->next;

          }

     pc->next=pa?pa:pb; //插入剩余段

     free(Lb);  //釋放Lb的頭節點

     }

}

转载于:https://www.cnblogs.com/luckylu/archive/2009/03/04/1403334.html