2-5浙大版《数据结构（第2版）》题目集

1. List Merge(List L1, List L2)
   {
   List La, Lb, Lc,p;
   La = L1->Next;
   Lb = L2->Next;
   Lc = (List)malloc(sizeof(struct Node));
   p = Lc;
   while (La&&Lb)
   {
   if (La->Data <= Lb->Data)
   {
   p->Next = La;
   p = La;
   La = La->Next;
   }
   else {
   p->Next = Lb;
   p = Lb;
   Lb = Lb->Next;
   }
   }
   p->Next = La? La : Lb;
   L1->Next = NULL;
   L2->Next = NULL;//为什么要把L1和L2指向NULL？？
   
   
   return Lc;
   }