两个有序链表序列的合并

输入分两行，分别在每行给出由若干个正整数构成的非降序序列，用−1表示序列的结尾（−1不属于这个序列）。数字用空格间隔。
分三个函数 读入函数Read ，合并函数LinkList，遍历输出函数Print

读入链表

List Read()
{
   
    int x;
    List q, r, head;
    scanf("%d", &x);
    head = (List)malloc(sizeof(struct node));
    r = head;
    while (x != -1)
    {
        q = (List)malloc(sizeof(struct node));
        q->data = x;
        q->next = NULL;
        r->next = q;
        r = r->next;
        scanf("%d", &x);
    }
   
    return head;
}

合并函数

List LinkList(List La, List Lb)
{
    List Lc, pa, pb, pc, ptr;
    pa = La->next;
    pb = Lb->next;
    Lc = La;
    pc = La;
    while(pa != NULL && pb != NULL)
    {
        if(pa->data < pb->data)
        {
            pc->next = pa;
            pc = pa;
            pa = pa->next;
        }
        else if(pa->data > pb->data)
        {
            pc->next = pb;
            pc = pb;
            pb = pb->next;
        }
        else
        {
            pc->next = pa;
            pc = pa;
            pa = pa->next;
            ptr = pb;
            pb = pb->next;
            free(ptr);
        }
    }
    if(pa != NULL)
        pc->next = pa;
    else
        pc->next = pb;
    return (Lc);
}

输出函数

void Print(List s)
{
    int k;
    k = 0;
    s = s->next;
    if (s == NULL)
    {
        printf("NULL");
        return;
    }
    while (s != NULL)
    {
        if (k != 0)
            printf(" ");
        printf("%d", s->data);
        s = s->next;
        k++;
    }
    printf("\n");
    return;
}

#include<stdio.h>
#include<stdlib.h>


typedef struct node* List;
struct node
{
    int data;
    struct node *next;
};

List Read()
{
    
    int x;
    List q, r, head;
    scanf("%d", &x);
    head = (List)malloc(sizeof(struct node));
    r = head;
    while (x != -1)
    {
        q = (List)malloc(sizeof(struct node));
        q->data = x;
        q->next = NULL;
        r->next = q;
        r = r->next;
        scanf("%d", &x);
    }
   
    return head;
}

List LinkList(List La, List Lb)
{
    List Lc, pa, pb, pc, ptr;
    pa = La->next;
    pb = Lb->next;
    Lc = La;
    pc = La;
    while(pa != NULL && pb != NULL)
    {
        if(pa->data < pb->data)
        {
            pc->next = pa;
            pc = pa;
            pa = pa->next;
        }
        else if(pa->data > pb->data)
        {
            pc->next = pb;
            pc = pb;
            pb = pb->next;
        }
        else
        {
            pc->next = pa;
            pc = pa;
            pa = pa->next;
            ptr = pb;
            pb = pb->next;
            free(ptr);
        }
    }
    if(pa != NULL)
        pc->next = pa;
    else
        pc->next = pb;
    return (Lc);
}

void Print(List s)
{
    int k;
    k = 0;
    s = s->next;
    if(s == NULL)
    {
        printf("NULL");
        return ;
    }
    while(s != NULL)
    {
        if(k != 0)
            printf(" ");
        printf("%d", s->data);
        s = s->next;
        k++;
    }
    printf("\n");
    return ;
}

int main()
{
    int x;
    List s1, s2, s3;
    s1 = Read();
    s2 = Read();
    s3 = LinkList(s1, s2);
    Print(s3);
    return 0;
}