本文整理汇总了Python中node.Node.next方法的典型用法代码示例。如果您正苦于以下问题：Python Node.next方法的具体用法？Python Node.next怎么用？Python Node.next使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类node.Node的用法示例。
在下文中一共展示了Node.next方法的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: main
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def main():
head1 = Node(1)
head1.next = Node(2)
head1.next.next = Node(3)
head1.next.next.next = Node(4)
head2 = Node(0)
head2.next = head1.next.next
print head1
print head2
print intersection(head1,head2)示例2: padList
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def padList( node, n):
head = node
for i in range(n):
new = Node(0)
new.next = head
head = new
return head示例3: add_to_head
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def add_to_head(self, data):
if not self.head:
self.head = Node(data)
self.tail = self.head
else:
new_node = Node(data)
new_node.next = self.head
self.head = new_node示例4: insert_head
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def insert_head(self , item):
if self.is_empty(self.head):
node_obj = Node(item)
self.head = self.tail = node_obj
else:
node_obj = Node(item)
node_obj.next = self.head
self.head = node_obj示例5: enqueue
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def enqueue(self, val):
enqueued = Node(val)
self.size += 1
if self.head is None:
self.head = enqueued
else:
enqueued.next = self.head
self.head = enqueued示例6: main
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def main():
head1 = Node(1)
head1.next = Node(2)
head1.next.next = Node(3)
head1.next.next.next = Node(4)
head1.next.next.next.next = head1.next
#print head1
print loopDetection(head1).data示例7: number_to_list_normal
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def number_to_list_normal(number):
head = Node(number%10)
number = number//10
while number > 0:
temp = Node(number%10)
temp.next = head
head = temp
number = number//10
return head示例8: number_to_list
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def number_to_list(number):
head = Node(number%10)
number = number//10
if number == 0:
return head
previous = Node(number%10)
tail = previous
number = number //10
while number > 0:
front = Node(number%10)
front.next = previous
previous = front
number = number//10
second = previous.next
tail.next = previous
previous.next = None
head.next = second
return head示例9: push_front
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def push_front(self, value):
node = Node(value)
self.size += 1
node.next = self.head
self.head = node
if (not self.tail):
self.tail = node示例10: insert_head
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def insert_head(self , data):
if self.head == None:
node_obj = Node(data)
self.head = self.tail = node_obj
else:
old_head = self.head
new_head = Node(data)
new_head.next = old_head
old_head.prev = new_head
self.head = new_head示例11: addAtDepth
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def addAtDepth(node,level,array_of_lists):
if node != None:
head = Node(node.key)
if len(array_of_lists) > level:
head.next = array_of_lists[level]
array_of_lists[level] = head
else:
array_of_lists.append(head)
addAtDepth(node.leftChild,level+1,array_of_lists)
addAtDepth(node.rightChild,level+1,array_of_lists)示例12: insert
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def insert(self, cargo):
node = Node(cargo)
node.next = None
if self.is_empty():
# if list is empty the new node goes first
self.head = self.last = node
else:
last = self.last
last.next = node
self.last = node
self.length = self.length + 1示例13: insert_at_front
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def insert_at_front(self, data):
# Create Node
new_node = Node(data)
# Set new_node.next = old head
new_node.next = self.head
# Set head = new_node
self.head = new_node
return示例14: addNode
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def addNode(self, cargo):
""" add a new node at the top of the list """
if cargo == None: return
node = Node(cargo)
if not self.isEmpty():
node.next = self.head
self.head = node
self.length = self.length + 1示例15: recursiveReverseSum
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import next [as 别名]
def recursiveReverseSum(head1, head2, carry):
if head1 == None and head2 == None and carry ==0:
return None
value = carry
if head1 != None:
value += head1.data
if head2 != None:
value += head2.data
result = Node(value%10)
if head1 != None or head2 != None:
more = recursiveReverseSum (None if head1 == None else head1.next, None if head2 == None else head2.next, 1 if value >=10 else 0)
result.next = more
return result