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

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param listNode ListNode类 
# @return int整型一维数组
#
class Solution:
    def printListFromTailToHead(self , listNode: ListNode) -> List[int]:
        # write code here
        #null
        # if not listNode:
        #     return None
        cur = listNode 
        pre = None
        while cur:
            tem = cur.next
            cur.next = pre
            pre = cur
            cur = tem
        a = []
        while pre:
            a.append(pre.val)
            pre = pre.next

        return a