輸入一個鏈表的頭節(jié)點，從尾到頭反過來返回每個節(jié)點的值（用數(shù)組返回）。

#?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]

python列表中[::-1]表示按照間隔一倒序輸出

test=[1,2,3,4,5,6]

test[::-1]=[6,5,4,3,2,1]

test[::-2]=[6,4,2]

[:-1]表示從0到-1之前的數(shù)

test[:-1]=[1,2,3,4,5]?