剑指offer - 从尾到头打印链表

struct ListNode
{
    int val;
    struct ListNode* next;
    ListNode(int x) :
        val(x), next(NULL) {
    }
};

class Solution {
private:
    

public:
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int> node;
        ListNode* ph = head;
        ListNode* p = head->next;
        ph->next = nullptr;
        
        while (p != nullptr)
        {
            ListNode* n = p->next;
            p->next = ph;
            ph = p;
            p = n;
        }
        while (ph)
        {
            ListNode* q = ph;
            node.push_back(ph->val);
            ph = ph->next;
            delete q;
        }
        return node;
    }
};