剑指 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) { 
   
        ListNode * t = new ListNode(0,NULL);
        ListNode * h = t;
        while(head){ 
   
            ListNode * tt = head->next;
            head->next = t->next;
            t->next = head;
            head = tt;
        }
        vector<int>res;
        while(h->next){ 
   
            res.push_back(h->next->val);
            h = h->next;
        }
        return res;
    }
};