2 回答

TA貢獻(xiàn)1856條經(jīng)驗 獲得超11個贊
在你的方法中append,last.next應(yīng)該是new_node
class Node:
def __init__(self,data):
self.data = data
self.next = None
class LinkedList:
def __init__(self):
self.head = None
def push(self,new_data):
new_node = Node(new_data)
new_node.next = self.head
self.head = new_node
def insertAfter(self,prev_node,new_data):
if prev_node is None:
return
new_node = Node(new_data)
new_node.next = prev_node.next
prev_node.next = new_node
def append(self,new_data):
new_node = Node(new_data)
if self.head is None:
self.head = new_node
return
last = self.head
while (last.next):
last = last.next
last.next = new_node
def printList(self):
temp = self.head
while (temp):
print(temp.data,end=' ')
temp = temp.next
if __name__ == '__main__':
llist = LinkedList()
llist.append(6)
llist.push(7)
llist.push(1)
llist.append(4)
llist.insertAfter(llist.head.next,8)
llist.printList()
輸出:
1 7 8 6 4

TA貢獻(xiàn)1808條經(jīng)驗 獲得超4個贊
函數(shù)中有一個錯誤append:
def append(self,new_data):
new_node = Node(new_data)
if self.head is None:
self.head = new_node
return
last = self.head
while last.next:
last = last.next
last.next = new_node # should not be new_data
添加回答
舉報