剑指 Offer 06. 从尾到头打印链表

剑指 Offer 06. 从尾到头打印链表

很明显后进先出，利用栈的结构辅助。

class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
        stack<int> tmp; 
        vector<int> ans;
        ListNode* pre = head;
        while(pre != NULL)
        {
            tmp.push(pre->val);
            pre = pre->next;
        }
        while(!tmp.empty())
        {
            ans.push_back(tmp.top());
            tmp.pop();
        }
        return ans;
    }
};