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

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
#include <cstddef>
#include <vector>
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int>res;
        stack<int>s;
        //正序输出
        while(head!=NULL)
        {
            s.push(head->val);
            head = head->next;
        }

        while(!s.empty()){
            res.push_back(s.top());
            s.pop();
        }
        return res;
    }
};