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

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) 
    {
        stack<int> stack_help;
        ListNode* temp=head;
        while(temp!=nullptr)
        {
            stack_help.push(temp->val);
            temp=temp->next;
        }
        //创建一个vector 返回逆序结果
        vector<int> vec;
        while(!stack_help.empty())
        {
            vec.push_back(stack_help.top());
            stack_help.pop();
        }
        return vec;
    }
};