题解 | 从尾到头打印链表

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
#include <cstdlib>
#include <iterator>
#include <vector>
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int> answer;
        ListNode *headptr_backup = head;
        while(headptr_backup)
        {
            headptr_backup = headptr_backup->next;

        }
        while(head)
        {
            answer.insert(answer.begin(), head->val);
            head = head->next;
        }
        return answer;
    }
};