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

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        7(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        ListNode* cur=head;
        vector<int> res;
        if(head==NULL)
        {
            return res;
        }
        while(cur!=NULL)
        {
            res.push_back(cur->val);
            cur=cur->next;
        }
        reverse(res.begin(), res.end());
        return res;
    }
};