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

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    void reverseHelper(ListNode* head,vector<int>& result){
        if(head==nullptr) return ;
        reverseHelper(head->next, result);
        result.push_back(head->val);
    }
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int> result;
        reverseHelper(head,result);
        return result;
    }
};