擅长:python、mysql、java
<p>尽管答案已经被接受,我还是尝试了这个解决方案,正如AChampion所说,在0处插入对我来说不起作用,但我的解决方案做到了:</p>
<pre><code>class Node :
def __init__(self,data=None,next_node=None) :
self.data = data
self.next = next_node
class LinkedList :
def __init__(self) :
self.head = None
def insertathead(self,new_data) :
new_node = Node(new_data)
new_node.next = self.head
self.head = new_node
def InsertNpos(self,new_data,pos):
if pos == 0:
self.head = Node(new_data, self.head)
return self.head
i = 0
curr = self.head
while curr.next:
if i == pos - 1:
curr.next = Node(new_data, curr.next)
return self.head
curr = curr.next
i += 1
curr.next = Node(new_data)
return self.head
def PrintLinkList(self) :
temp = self.head
while (temp) :
print (temp.data)
temp = temp.next
</code></pre>
<p>如果<code>pos</code>超出范围,这将在末尾插入项。在</p>