技術標籤：劍指offer每日一題leetcode連結串列

劍指 Offer 06. 從尾到頭列印連結串列

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
        vector<
 
int> V;
        for(ListNode* p = head; p; p = p->next) {
            V.insert(V.begin(), p->val);
        }
        return V;
    }
};