easy 剑指 Offer 从尾到头打印链表 STL 栈

---

双端容器：

c++ STL vector

class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
        vector<int> res;
        while(head){
            res.insert(res.begin(), head->val);  // 在指定位置插值 insert (位置迭代器)
            head = head->next;
        }
        return res;
    }
};

python

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        res = collections.deque([])  # python 双端队列 import collections
        while head:
            res.appendleft(head.val) # 在最左边添加一个元素
            head = head.next

        return list(res)  # 要求用数组返回

---

栈：

python

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        stk=[]
        while head:
            stk.append(head.val)
            head = head.next
            
        return stk[::-1]

---