我正在創(chuàng)建一個(gè)接受排序鏈表和值的函數(shù)。我通過 new_node = LN(v) 創(chuàng)建一個(gè)具有給定值的新節(jié)點(diǎn)。我正在嘗試返回一個(gè)鏈表，其中新節(jié)點(diǎn)位于正確的位置。該示例將有助于澄清。前任）ll = converts_list_to_linked_list([4, 7, 9, 14]) #我有一個(gè)鏈表：4->7->9->12->14功能：insert_ordered(ll, 12)返回“4->7->9->12->14->None”的鏈表我完全不知道如何將新節(jié)點(diǎn)插入正確的位置。我函數(shù)中的最后一個(gè) else 語(yǔ)句不正確。def insert_ordered(ll,x): new_node = LN(v) #Creates new node #If given ll is empty, newnode is the linkedlist if ll == None: ll = new_node #Makes new_node the head of ll if first val is >= new_node value. elif ll.value >= new_node.value: temp = ll ll = new_node ll.next = temp #[ERROR] Adds new_node between two nodes of ll in sorted order. else: while ll.next != None: if ll.value < new_node.value: ll = ll.next new_node.next = ll.next ll.next = new_node return ll迭代求解后，是否可以遞歸求解？
1 回答
SMILET
TA貢獻(xiàn)1796條經(jīng)驗(yàn) 獲得超4個(gè)贊
嘗試這個(gè)：
class LN:
def __init__(self, value):
self.value = value
self.next = None
def insert_ordered(root, data):
node = LN(data)
if root == None:
return node
else:
if root.value > data:
node.next = root
return node
else:
temp, prev = root, None
while temp.next and temp.value <= data:
prev = temp
temp = temp.next
if temp.next == None and temp.value <= data:
temp.next = node
else:
node.next = prev.next
prev.next = node
return root
root = None
root = insert_ordered(root, 4)
root = insert_ordered(root, 7)
root = insert_ordered(root, 9)
root = insert_ordered(root, 14)
root = insert_ordered(root, 12)
#4->7->9->12->14
添加回答
舉報(bào)
0/150
提交
取消