02-线性结构1 两个有序链表序列的合并 (15分)

#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;
}

/* 你的代码将被嵌在这里 */

输入样例：

3
1 3 5
5
2 4 6 8 10

输出样例：

1 2 3 4 5 6 8 10 
NULL
NULL

``

`List Merge( List L1, List L2 ){
    List T1,T2,L,Rear;

    L=(List)malloc(sizeof(struct Node));
    L->Next=NULL;
    Rear=L;
    T1=L1->Next;
    T2=L2->Next;

    while(T1&&T2){
        if(T1->Data < T2->Data){
            Rear->Next=T1;
            Rear=T1;
            T1=T1->Next;
        }
        else if(T1->Data > T2->Data){
            Rear->Next=T2;
            Rear=T2;
            T2=T2->Next;
        }
        else if(T1->Data == T2->Data){
            Rear->Next=T1;
            Rear=T1;
            T1=T1->Next;
            Rear->Next=T2;
            Rear=T2;
            T2=T2->Next;
        }
    }

    if(L1){
        Rear->Next=T1;
    }
    if(T2){
        Rear->Next=T2;
    }

    L1->Next=NULL;
    L2->Next=NULL;
    return L;
}

![在这里插入图片描述](https://img-blog.csdnimg.cn/20200308125314825.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDMxNDg3OA==,size_16,color_FFFFFF,t_70)