BJFU-225-基于链表的两个递增有序序列的合并

#include<stdio.h>
#include<stdlib.h>
typedef struct Lnode{
    int num;
    struct Lnode * next;
}Lnode,*LinkList;

typedef struct Link{
    LinkList data;
    struct Link * next;
}Link,*List;
void creatList(LinkList &L,int n)
{
    L = (LinkList)malloc(sizeof(Lnode));
    L->next = NULL;
    LinkList rear = L;

    for(int i=1;i<=n;i++)
    {
        LinkList p = (LinkList)malloc(sizeof(Lnode));

        scanf("%d",&p->num);
        rear->next = p;
        p->next = NULL;
        rear = p;
    }
}
void traverse(LinkList L)
{
    LinkList p = L->next;
    while(p)
    {
        if(p->next==NULL)
        {
            printf("%d",p->num);//最后一个数字的输出不能有空格，不然编译通不过。不要问我为什么！！！
        }else{
            printf("%d ",p->num);
        }

        p = p->next;
    }
    printf("
");
}
LinkList mergeList(LinkList La,LinkList Lb,int n,int m)
{
    LinkList Lc,a,b,c;
    Lc = La;
    a = La->next;
    b = Lb->next;
    c = Lc;

    while(a&&b)
    {
        if(a->num > b->num)
        {
            c->next = b;
            c = b;
            b = b->next;
        }else if(a->num==b->num)
        {
            LinkList q = b;
            c->next = a;
            c = a;
            a = a->next;
            b = b->next;
            free(q);
        }else
        {
            c->next = a;
            c = a;
            a = a->next;
        }
    }

    c->next = a?a:b;
    free(Lb);
    return Lc;
}
int main()
{
    int n,m;

    List Lc = (List)malloc(sizeof(Link));
    List r = Lc;
    while(1)
    {
        scanf("%d%d",&n,&m);
        if(n==0&&m==0) break;
        LinkList La,Lb;
        creatList(La,n);
        creatList(Lb,m);

        List pc = (List)malloc(sizeof(Link));
        LinkList Lc = mergeList(La,Lb,n,m);
        pc->data = Lc;
        r->next = pc;
        r = pc;
        pc->next = NULL;

    }
    List p = Lc->next;
    while(p)
    {
        traverse(p->data);
        p = p->next;
    }
}