<p>看完你的代码后,@johnbayko似乎是正确的,你必须离开self.top公司(哨兵头)独自一人。。。在您的代码中,您似乎有某些函数使用self.top公司out right和其他使用current=self.top公司引用它并在函数内完成相应的工作。<strong>函数的顶部指针应该正好是这样的,因为它应该是一个参考</strong>(<em>普遍-认为它是“北极星”,供您在导航列表时使用</em>),以供其余代码遵循。在</p>
<p>下面是更正的代码:在此之后理解链表等概念应该更容易些。在</p>
<pre><code>class Node:
def __init__(self,x):
self.data = x
self.next = None
class LinkedList:
def __init__(self):
self.top = None
def printList(self):
print("top^")
current = self.top
while current is not None:
print(current.data)
current = current.next
print("tail^")
def in_list(self, x):
current = self.top
while current is not None:
if current.data is x:
return 1
current = current.next
return 0
def findCellBefore(self, x):
current = self.top
if current is None:
return 0
while current.next is not None:
if current.next.data is x:
current = current.next
return 1
def findCellBeforeSential(self,x):
current = self.top
if (current.next is None):
return 0
while (current.next is not None):
if (current.next.data is x):
return current.data
return 1
def add_0(self, newNode):
# i. make next of new node as head.
newNode.next = self.top
# ii. move head to point to new node.
self.top = newNode
def add_end(self, newNode):
current = self.top
if (current is None):
self.add_0(newNode)
return
while (current.next is not None):
current = current.next
current.next = newNode
newNode.next = None
def insertNode(self, after_me, new_cell):
new_cell.next = after_me.next
after_me.next = new_cell
# update prev links.
new_cell.next.prev = new_cell
new_cell.prev = after_me
def deleteAfter(self, after_me):
after_me.next = after_me.next.next
def CopyList(self):#Out put new Linked List that is a copy of current Linked List with out altering it.
# create new LinkedList
newLinkedList = LinkedList()
current = self.top
#below is from stackoverflow : https://stackoverflow.com/questions/36491307/how-to-copy-linked-list-in-python
while current is not None:
newNode = Node(current.data)
newLinkedList.add_end(newNode)
current = current.next
return newLinkedList
print("here")
#current = self.top
#print(current)
#while current.next is not None:
# print(0)
# newNode = Node(self.top.data)
# print(1)
# newLinkedList.add_end(newNode)
# print(2)
# self.top = self.top.next
return newLinkedList
LIST0 = LinkedList()
node0 = Node(1)
node1 = Node(2)
node2 = Node(3)
LIST0.add_end(node1)
LIST0.add_0(node0)
LIST0.add_0(node2)
node3 = Node(4)
LIST0.insertNode(node2, node3)
LIST0.printList()
LIST1=LIST0.CopyList()
LIST1.printList()
</code></pre>