[PTA] 02-线性结构1 两个有序链表序列的合并

题目分析：

• 注意本题List与PtrToNode等效
• 熟悉链表的常规操作

答案

List Merge(List L1, List L2){
    PtrToNode L3 = (PtrToNode)malloc(sizeof(struct Node));
    L3->Next = NULL;
    PtrToNode pp = L3;
    PtrToNode p = L1->Next;
    PtrToNode q = L2->Next;
    while (p != NULL && q != NULL){
        if (p->Data < q->Data) {
            pp->Next = p;
            p = p->Next;
            pp = pp->Next;
        }
        else {
            pp->Next = q;
            q = q->Next;
            pp = pp->Next;
        }
    }
    if (p != NULL)
        pp->Next = p;
        
    if (q != NULL)
        pp->Next = q;

    L1->Next = NULL;
    L2->Next = NULL;
    return L3;
}

完整代码

#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){
    PtrToNode L3 = (PtrToNode)malloc(sizeof(struct Node));
    L3->Next = NULL;
    PtrToNode pp = L3;
    PtrToNode p = L1->Next;
    PtrToNode q = L2->Next;
    while (p != NULL && q != NULL){
        if (p->Data < q->Data) {
            pp->Next = p;
            p = p->Next;
            pp = pp->Next;
        }
        else {
            pp->Next = q;
            q = q->Next;
            pp = pp->Next;
        }
    }
    if (p != NULL)
        pp->Next = p;
        
    if (q != NULL)
        pp->Next = q;

    L1->Next = NULL;
    L2->Next = NULL;
    return L3;
}

List Read()
{
    int len;
    scanf("%d", &len);
    if (!len) return NULL;
    PtrToNode L3 = (PtrToNode)malloc(sizeof(struct Node));
    L3->Next = NULL;
    PtrToNode pp = L3;

    while (len--) {
        int tem;
        scanf("%d", &tem);
        PtrToNode Ll2 = (PtrToNode)malloc(sizeof(struct Node));
        Ll2->Data = tem;
        pp->Next = Ll2;
        pp = pp->Next;
    }
    return L3;
}
void Print(List L)
{
    PtrToNode pp = L;
    if (pp->Next == NULL){
        printf("NULL\n");
        return;
    }
    pp = pp->Next;
    while(pp != NULL){
        printf("%d ", pp->Data);
        pp = pp->Next;
    }
    puts("");
}