输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2] 输出:[2,3,1]
用栈FILO的特性
class Solution {
public:
vector<int> reversePrint(ListNode* head) {
stack<int> stack1;
vector<int> vector1;
ListNode* pre = head;
while(pre){
stack1.push(pre->val);
pre = pre->next;}
while(!stack1.empty()){
vector1.push_back(stack1.top());
stack1.pop();}
return vector1;
}
};