将两个有序链表La和Lb合并为一个有序链表。

将两个有序链表La和Lb合并为一个有序链表。

#include <stdio.h>

#include <stdlib.h>

typedef int ElemType;

typedef struct LNode{

        ElemType data;

        struct LNode *next;

}LNode,*LinkList;

LinkList Create_LinkList(int n)

{          LNode *L,*p,*q;

           int i;

           L=(LNode *)malloc(sizeof(LNode));

           L->next=NULL;

           q=L;

           for(i=0;i<=n-1;i++)

           {         p=(LNode *)malloc(sizeof(LNode));

                     printf("请输入%d个元素的值：",i+1);

                     scanf("%d",&p->data);

                     p->next=NULL;q->next=p;q=p;

           }

           return L;

}

LinkList MergeList_L(LinkList La,LinkList Lb)

{           LNode *pa,*pb,*pc,*Lc;

            pa=La->next;pb=Lb->next;

            Lc=pc=La;

            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(Lb);

            return Lc;

}

void main()

{

        LNode *La,*Lb,*Lc,*p;

        La=Create_LinkList(2);

        Lb=Create_LinkList(3);

        Lc=MergeList_L(La,Lb);

        p=Lc->next;

        while(p)

        {         printf("%d",p->data);

                  p=p->next;

        }

        printf("\n");

}