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

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