输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
输入:head = [1,3,2] 输出:[2,3,1]solution
class Solution {
public:
vector reversePrint(ListNode* head) {
vectora;
ListNode*curr1=head;
while(curr1)
{
a.push_back(curr1->val);
curr1=curr1->next;
}
reverse(a.begin(),a.end());
return a;
}
};



