剑指 Offer 06. 从尾到头打印链表 (reverse C++)

用vector存 然后reverse倒置即可

class Solution {
public:
    vector reversePrint(ListNode* head) {
        vector v;
        while(head != NULL) {
            v.push_back(head->val);
            head = head -> next;
        }
        reverse(v.begin(), v.end());
        return v;
    }
};