数据格式笔记
算法图解 # 在线书: https://www.hello-algo.com 单向链表实现和反转 # # 单向链表实现和反转 """ # 当前值, 下一个值 # 循环 # 将当前值赋值为下一个的值, 下一个节点值为当前节点值 # 当前节点next赋 """ class A: def __init__(self, v): self.v = v self.next = None class LA: def __init__(self): self.head = None def add(self, v): node = A(v) node.next = self.head self.head = node def print(self): cur = self.head while cur and cur.v != None: print(f"linkdata node v: {cur.v}") cur = cur.next def revert(self, node: A=None, head=None): if not head: cache = self. ...