两个有序链表的合并

#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 Read()
{
	int num;
	List L;
	L=(List)malloc(sizeof(struct Node));
	L->Next =NULL;
	scanf("%d",&num);
	List last=L;//表尾指针，用来插入 
	for(int i=0;i<num;i++)
	{
		List N;//创建新节点
		N=(List)malloc(sizeof(struct Node)); 
		scanf("%d",&N->Data);
		N->Next=NULL;
		last->Next=N;
		last=N;
	 }
	return L;
}

void Print( List L )
{
	if(L->Next == NULL)
		printf("NULL\n");
	else
	{
		List p;
		p=L->Next;
		while(p)
		{
			printf("%d",p->Data);
			p=p->Next;
		}
		printf("\n");
	 } 
} 

List Merge( List L1, List L2 )
{
	List L;
	L=(List)malloc(sizeof(struct Node));
	List p1,p2;
	List Last;
	Last=L;
	p1=L1->Next;
	p2=L2->Next;
	while(p1&&p2)
	{
		if(p1->Data<=p2->Data)
		{
			if(p1->Data==p2->Data)
			{
				Last->Next=p2;
				Last=p2;
				L2->Next =p2->Next;
				p2->Next =NULL;
				p2=L2->Next;
			}
			Last->Next=p1;
			Last=p1;
			L1->Next =p1->Next;
			p1->Next =NULL;
			p1=L1->Next;
		}
		else
		{
			Last->Next=p2;
			Last=p2;
			L2->Next =p2->Next;
			p2->Next =NULL;
			p2=L2->Next;
		}
	}
	if(p1)
	{
		Last->Next=p1;
		L1->Next=NULL;
	}
	if(p2)
	{
		Last->Next=p2;
		L2->Next=NULL;
	}
	return L;
}