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

#include <cstddef>
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        stack<int> sc;
        vector<int> v;
        while(head)
        {
            sc.push(head->val);
            head=head->next;
        }
        while(!(sc.empty()))
        {
            v.push_back(sc.top());
            sc.pop();
        }
        return v;
    }
};