剑指offer题解C++【3】

题目描述

解题思路

代码

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
vector<int> res;
stack<int> mystack;
while (head) {
mystack.push(head->val);
head = head->next;
}

while (!mystack.empty()) {
res.push_back(mystack.top());
mystack.pop();
}
return res;
}
};