从尾到头打印链表

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        std::stack<ListNode*>nodes;

        ListNode* pNode=head;
        while(pNode!=NULL){
            nodes.push(pNode);
            pNode=pNode->next;
        }
        vector<int> result;
        while(!nodes.empty()){
            pNode=nodes.top();
            result.push_back(pNode->val);
            nodes.pop();
        }
        return result;
    }
};