输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。

    示例 1：
    输入：head = [1,3,2]
    输出：[2,3,1]

    1. class Solution:
    2.     def reversePrint(self, head: ListNode) -> List[int]:
    3.         if head is None:
    4.             return []
    5.         res = []
    6.         cur = head
    7.         while cur != None:
    8.             res.append(cur.val)
    9.             cur = cur.next
    10.         return res[::-1]