#include <stdio.h>
#include <stdlib.h>
typedef int ElementType;
typedef struct Node *PtrToNode;
struct Node {
ElementType Data;
PtrToNode Next;
};
typedef PtrToNode List;
List Read(); /* 细节在此不表 */
void Print( List L ); /* 细节在此不表;空链表将输出NULL */
List Merge( List L1, List L2 );
int main()
{
List L1, L2, L;
L1 = Read();
L2 = Read();
L = Merge(L1, L2);
Print(L);
Print(L1);
Print(L2);
return 0;
}
/* 你的代码将被嵌在这里 */
List Merge(List L1, List L2)
{
if(!L1&&!L2)
return NULL;
List pa,pb,pc,L;
L = (List)malloc(sizeof(struct Node));
pa = L1->Next; //L1带头节点
pb = L2->Next;
pc = L;
while(pa && pb)
{
if(pa->Data <= pb->Data)
{
pc->Next =pa;
pc = pa; //移动pc
pa = pa->Next; //移动pa
}
else
{
pc->Next =pb;
pc = pb;
pb = pb->Next;
}
}
if(pa)
pc->Next = pa;
else if(pb)
pc->Next =pb;
L1->Next = NULL;//清空L1,L2
L2->Next =NULL;
return L;
}