题解 | #从尾到头打印链表#
从尾到头打印链表
https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
#include <vector>
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
stack<int>stk;
vector<int>res;
while(head){
stk.push(head->val);
head=head->next;
}
while(stk.size()){
res.push_back(stk.top());
stk.pop();
}
return res;
}
};
查看9道真题和解析
