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

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/

class Solution {
public:
    vector<int> v1;
    vector<int> printListFromTailToHead(ListNode* head) {
        if(head != nullptr){
            v1.push_back(func( head ));
            return v1;
        }else return v1 ;
    }   
    int func(ListNode* list_ ){    
    if (  list_->next !=nullptr ){
       v1.push_back(func(list_->next));
    }
    return list_->val;
}
};