算法入门(10)合并两个有序表

将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例：
输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

def mergeTwoLists(l1: ListNode, l2: ListNode) -> ListNode:
    # 合并两个有序列表
    l3 = t=ListNode(0)
    while l1 or l2:
        if l1 and l2:
            if l1.val<l2.val:
                l3.next = l1
                l1 = l1.next
                l3 = l3.next
            else:
                l3.next = l2
                l2 = l2.next
                l3 = l3.next
        else:
            if l1:
                l3.next = l1
                l1 = l1.next
                l3 = l3.next
            else:
                l3.next = l2
                l2 = l2.next
                l3 = l3.next
    return t.next
if __name__ == "__main__":
    # 1->2->4, 1->3->4
    l1 = ListNode(1)
    l2 = ListNode(2)
    l3 = ListNode(3)
    l1.next = l2
    l2.next = l3
    l4 = ListNode(1)
    l5 = ListNode(3)
    l6 = ListNode(4)
    l4.next = l5
    l5.next = l6
    l3 = mergeTwoLists(l1,l4)
    while l3:
        print(l3.val,end=" ")
        l3 = l3.next