题解 | #从尾到头打印链表#

class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> ret;
while(head){
ret.push_back(head->val);
head = head->next;
}
std::reverse(ret.begin(),ret.end());
return ret;
}
};</int></int>