概念
链表结构,由多个Node组成,具有特定的顺序,并可快速插入和删除的数据结构。(自己描述的)
定义Node
class Node:
def __init__(self, data, pn=None):
self._data = data
self._next = pn
def __repr__(self):
return str(self._data)
def get_next(self):
return self._next
def set_next(self, pn):
self._next = pn
定义print linked list
def print_node(node: Node):
while node is not None:
print(node)
node = node.get_next()
倒排链表结构
def reserve_linked_list(node):
pre = node
_next = node.get_next()
pre.set_next(None)
while _next is not None:
tmp = _next.get_next()
_next.set_next(pre)
pre = _next
_next = tmp
return pre
测试代码
def test():
node3 = Node(3)
node2 = Node(2, node3)
node1 = Node(1, node2)
print_node(node1)
print_node(reserve_linked_list(node1))