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

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int> ve;
        ListNode* h = head;
        while (h != NULL) {
            ve.push_back(h->val);
            h = h->next;
        }
        return vector<int>(ve.rbegin(), ve.rend());
    }
};