02-线性结构1 两个有序链表序列的合并完整实现 c

实验平台:pta https://pintia.cn/

#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;
    List L = (PtrToNode)malloc(sizeof(struct Node));
    PtrToNode p = L;
    scanf("%d",&n);
    for(int i = 0; i < n; i ++){
        p->Next = (PtrToNode)malloc(sizeof(struct Node));
        scanf("%d",&(p->Next->Data));
        p = p->Next;
    }
    p->Next = NULL;
    return L;
}

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

/* 你的代码将被嵌在这里 */
List Merge(List L1, List L2){
	List L = (PtrToNode)malloc(sizeof (struct  Node));
	L->Next = NULL;     //易错点，L1,L2可能都为空
	PtrToNode p = L;
	PtrToNode p1 = L1 -> Next;
	PtrToNode p2 = L2 -> Next;
	while(p1 && p2 ){
		if(p1->Data >= p2->Data){
			p->Next= p2;
			p2 = p2 -> Next;
		}
		else{
			p->Next= p1;
			p1 = p1->Next;
		}
		p = p->Next;
	}
	if(p1)
		p->Next= p1;
	if(p2)
		p->Next= p2;
	L1 -> Next = NULL;
	L2 -> Next = NULL;
	return L;
}