从尾到头打印链表

题目描述

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

stack<int> stack;
vector<int> vector;
struct ListNode *p = head;
while(p != NULL) {
stack.push(p->val);
p=p->next;
}
while(!stack.empty()) {
vector.push_back(stack.top());
stack.pop();
}

return vector;
}

};