剑指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> res;
        ListNode *hp = head;
        int cnt = 0;
        while(hp){
            cnt++;
            hp = hp->next;
        }
        int *tmp = new int[cnt + 1], ii = 0;
        hp = head;
        while(hp){
            tmp[ii++] = hp->val;
            hp = hp->next;
        }
        for(int i = ii - 1; i >= 0; --i){
            res.push_back(tmp[i]);
        }
        delete[] tmp;
        return res;
    }
};