从尾到头打印链表

/**
 * 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) {
        vector<int> ar={};
        ListNode* p=head;
        ListNode *pre=new ListNode(0);
        pre->next=nullptr;
        while(p!=nullptr)
        {
            ListNode* q=new ListNode(p->val);
            q->next=pre->next;
            pre->next=q;
            p=p->next;
        }
        p=pre->next;
        for(int i=0;p!=nullptr;i++,p=p->next)
        {
            ar.push_back(p->val);
        }
        while(pre!=nullptr)
        {
            p=pre;
            pre=pre->next;
            delete p;
            p=nullptr;
        }
        return ar;
    }
};