JZ6题解 | #从尾到头打印链表#

/**
*  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, tempVec;
        if (head == nullptr) {
            return res;
        }
        ListNode* p = head;
        while (p != nullptr) {
            tempVec.push_back(p->val);
            p = p->next;
        }
        for (int i = tempVec.size() - 1; i >= 0; i--) {
            res.push_back(tempVec[i]);
        }
        return res;
    }
};