数据结构——两个有序数组的合并

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

typedef int ElementType;
typedef struct Node {
    ElementType data;
    struct Node  *next;
}Lnode,*Linklist;


void Read(Linklist *L)
{
    int i,k,n;
    Linklist s,rear;
    *L = (Linklist)malloc(sizeof(Lnode));
    rear = *L;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        s = (Linklist)malloc(sizeof(Lnode));
        scanf("%d",&k);
        s->data = k;
        rear->next = s;
        rear = s;
    }
    rear->next = NULL;
}
void Print( Linklist L )
{
    Linklist p = L->next;
    if(p==NULL)
        printf("NULL
");
    else
    {
        while(p)
    {
        printf("%d ",p->data);
        p = p->next;
    }
    printf("
");
    }


}
void Merge( Linklist *L1, Linklist *L2,Linklist *L )
{
    Linklist pa = (*L1)->next;
    Linklist pb = (*L2)->next;
    Linklist pc = (Linklist)malloc(sizeof(Lnode));
    *L = pc = *L1;
    while(pa && pb)
    {
        if(pa->data <= pb->data)
        {
            pc->next = pa;
            pc = pa;
            pa = pa->next;
        }
        else
        {
            pc->next = pb;
            pc = pb;
            pb = pb->next;
        }
    }
    pc->next = pa ? pa : pb;
    free(*L2);
}


int main()
{
    Linklist L1, L2, L;
    Read(&L1);
    Read(&L2);

    Merge(&L1, &L2, &L);
    
    Print(L);
    return 0;
}