输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
限制:
0 <= 链表长度 <= 10000
遍历链表存到数组中,对数组进行反转
class Solution {
public:
vector reversePrint(ListNode* head) {
vector res;
while(head) {
res.emplace_back(head->val);
head = head->next;
}
reverse(res.begin(), res.end());
return res;
}
};



