链表合并

class LNode:
    def __init__(self, val):
        self.val = val
        self.next = None


def Merge(PHead1, PHead2):
    if PHead1 is None:
        return PHead2
    if PHead2 is  None:
        return PHead1
    pre = None
    if PHead1.val < PHead2.val:
        pre = PHead1
        pre.next = Merge(PHead1.next, PHead2)
    else:
        pre = PHead2
        pre.next = Merge(PHead1, PHead2.next)
    return pre

if __name__ == "__main__":
    PHead1 = LNode(1)
    p1 = LNode(3)
    p2 = LNode(5)
    PHead1.next = p1
    p1.next = p2

    PHead2 = LNode(2)
    p3 = LNode(4)
    p4 = LNode(6)
    PHead2.next = p3
    p3.next = p4
    L = Merge(PHead1, PHead2)
    while L:
        print(L.val)
        L = L.next