Python 合并两个有序链表：完整代码和示例

以下是合并两个有序链表的完整代码：

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


def mergeTwoLists(l1, l2):
    dummy = ListNode(0)
    curr = dummy

    while l1 and l2:
        if l1.val < l2.val:
            curr.next = l1
            l1 = l1.next
        else:
            curr.next = l2
            l2 = l2.next
        curr = curr.next

    if l1:
        curr.next = l1
    else:
        curr.next = l2

    return dummy.next


# 示例测试
# 创建链表1: 1 -> 2 -> 4
l1 = ListNode(1)
l1.next = ListNode(2)
l1.next.next = ListNode(4)

# 创建链表2: 1 -> 3 -> 4
l2 = ListNode(1)
l2.next = ListNode(3)
l2.next.next = ListNode(4)

# 合并两个链表
merged = mergeTwoLists(l1, l2)

# 输出合并后的链表: 1 -> 1 -> 2 -> 3 -> 4 -> 4
while merged:
    print(merged.val, end=" -> ")
    merged = merged.next
print("None")

输出结果为：1 -> 1 -> 2 -> 3 -> 4 -> 4 -> None