题解 | #从尾到头打印链表#-先反转链表, 再顺序打印.

#     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
        # 1.先反转链表再加入数组 2.先加入数组再反转数组-行不通
        result = []
        pre = None
        cur = listNode
        while cur:
            temp = cur.next
            cur.next = pre
            pre = cur
            cur = temp
        
        point = pre        
        while point:
            result.append(point.val)
            point = point.next
        return result