题解 | #从尾到头打印链表#
从尾到头打印链表
https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035
/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : * val(x), next(NULL) { * } * }; */ class Solution { public: vector<int> printListFromTailToHead(ListNode* head) { vector<int> result; stack<int> s; //正序输出链表放入栈中 while (head!=NULL) { s.push(head->val); head=head->next; } //输出栈中元素到数组 while(!s.empty()) { result.push_back(s.top()); s.pop(); } return result; } };