我用Python編寫了一個(gè)函數(shù)來合并兩個(gè)排序的鏈表。這是代碼：- class Node:    def __init__(self, data):        self.data = data        self.next = Noneclass LinkedList:    def __init__(self):        self.head = None    def append(self, data):        new_node = Node(data)        if self.head is None:            self.head = new_node            return        last_node = self.head        while last_node.next is not None:            last_node = last_node.next        last_node.next = new_node        def print(self):        cur_node = self.head        while cur_node.next is not None:            print(cur_node.data, "-> ", end='')            cur_node = cur_node.next        print(cur_node.data)def merge(l1, l2):    cur_node1 = l1.head    cur_node2 = l2.head    l3 = LinkedList()    while cur_node1.next is not None or cur_node2.next is not None:        if cur_node1.data > cur_node2.data:            l3.append(cur_node2.data)            cur_node2 = cur_node2.next        else:            l3.append(cur_node1.data)            cur_node1 = cur_node1.next    if cur_node1.next is None:        l3.append(cur_node1.data)        while cur_node2.next is not None:            l3.append(cur_node2.data)            cur_node2 = cur_node2.next        l3.append(cur_node2.data)    elif cur_node2.next is None:        l3.append(cur_node2.data)        while cur_node1.next is not None:            l3.append(cur_node1.data)            cur_node1 = cur_node1.next        l3.append(cur_node1.data)    return l3ll1 = LinkedList()ll2 = LinkedList()ll1.append(12)ll1.append(45)ll1.append(69)ll1.append(70)ll2.append(1)ll2.append(2)ll2.append(99)ll2.append(100)ll3 = merge(ll1, ll2)ll3.print()這里發(fā)生了什么？我不明白。我嘗試在合并函數(shù)的 while 循環(huán)中運(yùn)行沒有 or 語句的代碼。效果很好。顯然問題出在 while 語句中。有人可以幫忙嗎？