输入一个链表,从尾到头打印链表每个节点的值。返回新链表的头结点。
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> ret;
while (head) {
ret.push_back(head->val);
head = head->next;
reverse(ret.begin(), ret.end());
return ret;
}
};