有序链表的合并

 

裁判测试程序样例：

#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)
{
    struct  Node* Head = (struct Node*)malloc(sizeof(struct Node));
    struct Node* p= Head;
    struct  Node* p1 = L1->Next;
    struct  Node* p2 = L2->Next;
    while (p1 && p2)
    {
        if (p1->Data <= p2->Data)
        {
            p->Next = p1;
            p = p->Next;
            p1 = p1->Next;    
        }
        else if (p1->Data > p2->Data)
        {
            p->Next = p2;
            p = p->Next;
            p2 = p2->Next;
        }
    }
    if (p1)
        p->Next = p1;
    if (p2)
        p->Next = p2;
    L1->Next = NULL;
    L2 ->Next= NULL;
    return Head;
}