从尾到头打印链表（栈）

classSolution {

public:

    vector<int> printListFromTailToHead(ListNode* head) {

    vector<int> result;

    std::stack<ListNode*> nodes;

 

    ListNode* pNode = head;

    while(pNode){

        nodes.push(pNode);

        pNode = pNode->next;

    }

 

    while(!nodes.empty()){

        pNode = nodes.top();

        result.push_back(pNode->val);

        nodes.pop();

    }

 

    returnresult;

}

};