合并k个有序链表 c语言,习题2.5 两个有序链表序列的合并（15 分）

/*做完之后才发现自己做麻烦了*/

List Merge( List L1, List L2 )

{

List L=(List)malloc(sizeof(struct Node));

List l1=L1->Next;

List l2=L2->Next;

List newn,pre=L;;

while(l1&&l2)

{

if(l1->DataData)

{

List newn=(List)malloc(sizeof(struct Node));

newn->Data=l1->Data;

newn->Next=NULL;

pre->Next=newn;

pre=newn;

l1=l1->Next;

}

else

{

List newn=(List)malloc(sizeof(struct Node));

newn->Data=l2->Data;

newn->Next=NULL;

pre->Next=newn;

pre=newn;

l2=l2->Next;

}

}

if(l1||l2)

{

while(l1)

{

List newn=(List)malloc(sizeof(struct Node));

newn->Data=l1->Data;

newn->Next=NULL;

pre->Next=newn;

pre=newn;

l1=l1->Next;

}

while(l2)

{

List newn=(List)malloc(sizeof(struct Node));

newn->Data=l2->Data;

newn->Next=NULL;

pre->Next=newn;

pre=newn;

l2=l2->Next;

}

}

L1->Next=NULL;

L2->Next=NULL;

return L;

}