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

递归遍历链表，倒序输出。

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