输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
限制:
0 <= 链表长度 <= 10000
class Solution {
public:
vector<int> reversePrint(ListNode* head) {
vector<int> res;
while(head){
res.push_back(head->val);
head = head -> next;
}
reverse(res.begin(),res.end());
return res;
}
};
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
ans = []
while head:
ans.append(head.val)
head = head.next
return ans[::-1]
class Solution {
public:
vector<int> reversePrint(ListNode* head) {
if(head == nullptr) return {};
vector<int> res = reversePrint(head->next);
res.push_back(head->val);
return res;
}
};
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
if not head:
return []
else:
return self.reversePrint(head.next) + [head.val]