[剑指offer] 从尾到头打印链表

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int> re;
        while (head) {
            re.push_back(head->val);
            head = head->next;
        }
        for (int i = 0; i < re.size() / 2; i++) swap(re[i], re[re.size() - 1 - i]);
        return re;
    }
};