从尾到头打印链表

输入一个链表，按链表从尾到头的顺序返回一个ArrayList。

 

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