剑指 Offer 06. 从尾到头打印链表

原题链接：剑指 Offer 06. 从尾到头打印链表

solution:

遍历一边链表，用数组保存节点值,最后reverse. 时间复杂度O(n)

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