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

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        if(head == nullptr){
            return {};
        }
        if( head->next == nullptr){
            return {head->val};
        }
        stack<int> s;
        vector<int> res;
        while(head != nullptr){
            s.push(head->val);
            head = head ->next;
        }
        while(!s.empty()){
            res.push_back(s.top());
            s.pop();
        }
        return res;
    }
};