两个有序链表序列的合并

两个有序链表序列的合并

#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 n;
scanf("%d",&n);
List L=(List)malloc(sizeof(PtrToNode)); ///申请一个头结点
L->Next = NULL; ///头指针为空
if(n) ///当n不是0时
{
List r=L; ///r是一个中间变量的节点
for(int i=0;i<n;i++)
{
List p=(List)malloc(sizeof(struct Node));
scanf("%d",&(p->Data)); ///尾插法
r->Next = p;
r = p;
}
r->Next = NULL;
}
return L;
}

void Print( List L )
{
List p=L->Next;
if§
{
List r;
r = L;
while(r->Next)
{
r = r->Next;
printf("%d “,r->Data);
}
}
else
{
printf(“NULL”);
}
printf(”\n");
}
List Merge( List L1, List L2 ){
List p1=(List)malloc(sizeof(struct Node));
List p=p1;
List M=L1->Next;
List N=L2->Next;
while(M&&N){
if(M->Data<=N->Data){
p1->Next=M;
p1=M;
M=M->Next;
}else{
p1->Next=N;
p1=N;
N=N->Next;
}
}
if(M) p1->Next=M;
if(N) p1->Next=N;
L1->Next=NULL;
L2->Next=NULL;
return p;
}