题解 | #从尾到头打印链表#

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
# @param listNode ListNode类 
# @return int整型一维数组
#python 关于栈的实现
class Solution:
    def printListFromTailToHead(self , listNode: ListNode) -> List[int]:
        #解法一：遍历元素存入列表，将列表反转
        res = []
        head = listNode
        while head != None:
            res.append(head.val)
            head = head.next
        return res[::-1]