两种实现方法,栈or递归 # 从尾到头打印链表 class ListNode: def __init__(self, v): self.val = v self.next = None def create(self, p, v): while p.next != None: p = p.next p.next = ListNode(v) # 递归实现 class recurSolution: def printListFromTailToHead(self, listNode): ...