剑指 Offer 06. 从尾到头打印链表python

class ListNode():
    def __init__(self, x):
        self.val = x
        self.next = None

class Solution():
    def reprint(self, head):
        stack = []
        while head:
            stack.append(head.val)
            head = head.next
        return stack[::-1]


node0 = ListNode(0)
node1 = ListNode(1)
node2 = ListNode(2)
node0.next = node1
node1.next = node2
solution = Solution()
ans = solution.reprint(node0)
print(ans)

创建链表和打印链表参考：https://blog.csdn.net/Chasing__Dreams/article/details/108405487?ops_request_misc=&request_id=&biz_id=102&utm_term=python%E5%89%91%E6%8C%87%20Offer%2006.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8%EF%BC%8Cne&utm_medium=distribute.pc_search_result.none-task-blog-2_allsobaiduweb~default-0-108405487.142^v92control&spm=1018.2226.3001.4187