中国大学MOOC-陈越、何钦铭-数据结构-2022夏: 02-线性结构1 两个有序链表序列的合并

Code:

List Merge( List L1, List L2 ) {
    List L = (List)malloc(sizeof(struct Node)); //
    List z = L1->Next, k = L2->Next, x = L; 
    while (z && k) {
        if (z->Data < k->Data) {
            x->Next = z;
            z = z->Next;
        } else {
            x->Next = k;
            k = k->Next;
        }
        x = x->Next;
    }

    if(z) {
        x->Next = z;
    } 
    if(k) {
        x->Next = k;
    }
    L1->Next = NULL; //
    L2->Next = NULL; //
    return L;
}