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

愚蠢的自己

List Merge( List L1, List L2 ){
    List L3 = (List)malloc(sizeof(struct Node));
    List This = L3;
    while(L1->Next||L2->Next){
        if(L1->Next==NULL){
            This->Next = L2->Next;
            L2->Next = NULL;
        }
        else if(L2->Next==NULL){
            This->Next = L1->Next;
            L1->Next = NULL;
        }
        else if(L1->Next->Data<=L2->Next->Data){
            This->Next = L1->Next;
            This = L1->Next;
            L1->Next = This->Next;
        }
        else if(L1->Next->Data>L2->Next->Data){
            This->Next = L2->Next;
            This = L2->Next;
            L2->Next = This->Next;
        }
        
    }
    return L3;
}

可以将L1->Next,L2->Next用pa,pb代替