思路：遍历链表，通过数组来存储读取到的value，最终逆序输出
Python：
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
res=[]
while head:
res.append(head.val)
head=head.next
return res[::-1]
原创文章，作者：sunnyman218，如若转载，请注明出处：https://blog.ytso.com/tech/pnotes/245076.html