本文整理汇总了Python中node.Node.setNext方法的典型用法代码示例。如果您正苦于以下问题：Python Node.setNext方法的具体用法？Python Node.setNext怎么用？Python Node.setNext使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类node.Node的用法示例。
在下文中一共展示了Node.setNext方法的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: insert
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def insert(self, pos, data):
new_node = Node(data)
temp = self.head
if pos == 0:
self.add(data)
elif pos == self.size():
self.append(data)
else:
for i in range(pos):
temp = temp.getNext()
new_node.setNext(temp.getNext())
temp.setNext(new_node)开发者ID:shade34321，项目名称:problem_solving_with_algorithms_and_data_structures，代码行数:16，代码来源:unordered_list.py
示例2: insert
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def insert(self,index,item):
if index > self.size() or index < 0:
raise ValueError('Index out of bounds')
elif index == 0:
temp = Node(item)
temp.setNext(self.head)
self.head = temp
else:
count = 0
current = self.head
for i in range(index-1):
current = current.getNext()
newNode = Node(item)
newNode.setNext(current.getNext())
current.setNext(newNode)示例3: insert
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def insert(self, pos, item):
# insert item at position
count = 0
current = self.head
previous = None
while count < pos:
previous = current
current = current.getNext()
count = count + 1
new_node = Node(item)
new_node.setNext(current)
if previous is not None:
previous.setNext(new_node)
else:
self.head = new_node示例4: insert
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def insert(self, position, item):
n = Node(item)
current = self.head
previous = None
for i in range(position):
previous = current
current = current.getNext()
if previous == None:
n.setNext(current)
self.head = n
else:
n.setNext(current)
previous.setNext(n)
return示例5: insert
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def insert(self,pos,item):
current = self.head
previous = None
count = 0
newnode = Node(item)
while current.getNext() != None and not count == pos:
previous = current
current = current.getNext()
count = count + 1
temp = Node(item)
if previous == None:
temp.setNext(self.head)
self.head = temp
else:
temp.setNext(current)
previous.setNext(temp)示例6: add
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def add(self, item):
current = self.head
previous = None
stop = False
while current != None and not stop:
if current.getData() > item:
stop = True
else:
previous = current
current = current.getNext()
temp = Node(item)
if previous == None:
temp.setNext(self.head)
self.head = temp
else:
temp.setNext(current)
previous.setNext(temp)示例7: add
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def add(self, item):
new_node = Node(item)
temp = self.head
inserted = False
prev = None
while temp and not inserted:
if item < temp.getData():
inserted = True
else:
prev = temp
temp = temp.getNext()
new_node.setNext(temp)
if not prev:
self.head = new_node
else:
prev.setNext(new_node)开发者ID:shade34321，项目名称:problem_solving_with_algorithms_and_data_structures，代码行数:21，代码来源:ordered_list.py
示例8: insert
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def insert(self, index, item):
new_node = Node(item)
if index == 0:
new_node.setNext(self.head)
self.head = new_node
return True
else:
curr = self.head
prev = None
itr = 0
while curr != None and itr != index:
prev = curr
curr = curr.getNext()
itr += 1
if itr == index:
new_node.setNext(curr)
previous_node.setNext(new_node)
return True
else:
return False示例9: add
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def add(self, item):
"""adds a new item to the list making sure that the order is preserved.
It needs the item and returns nothing.
"""
current = self.head
previous = None
stop = False
while current is not None and not stop:
if current.getData() > item:
stop = True
else:
previous = current
current = current.getNext()
temp = Node(item)
if previous is None:
temp.setNext(self.head)
self.head = temp
else:
temp.setNext(current)
previous.setNext(temp)示例10: insert
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def insert(self, pos, item):
"""adds a new item to the list at position pos.
It needs the item and returns nothing. """
if pos == 0:
self.add(item)
if pos >= self.length():
self.append(item)
return
current = self.head
previous = None
count = 0
while count < pos:
count = count + 1
previous = current
current = current.getNext()
temp = Node(item)
temp.setNext(current)
previous.setNext(temp)示例11: add
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def add(self,item):
newNode = Node(item)
if self.head == None:
self.head = newNode
else:
previous = None
current = self.head
if current.getValue() > newNode.getValue():
newNode.setNext(self.head)
self.head = newNode
else:
while current != None:
if current.getValue() > item:
previous.setNext(newNode)
newNode.setNext(current)
break
else:
previous = current
current = current.getNext()
if current == None:
previous.setNext(newNode)示例12: add
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def add(self, item):
temp = Node(item)
temp.setNext(self.head)
self.head = temp示例13: add
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def add(self, item):
n = Node(item)
n.setNext(self.head)
self.head = n示例14: add
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def add(self, item):
new_node = Node(item)
new_node.setNext(self.head)
self.head = new_node示例15: add
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import setNext [as 别名]
def add(self, item):
temp = Node(item) #initialize the new Node with the item data
temp.setNext(
self.head) #we now need to link it into the structure of the list
self.head = temp #reassign the value of head