面试题06：从尾到头打印链表（C++）

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
        vector<int> revResult;
        stack<int> sk;
        while(head != nullptr)
        {
            sk.push(head->val);
            head = head->next;
        }
        while(!sk.empty())
        {
            revResult.push_back(sk.top());
            sk.pop();
        }
        return revResult;
    }
};