递归 反转链表 - lifengyu360/lifengyu_first_git_test GitHub Wiki

class Solution {

public:

ListNode* new_list = nullptr;
ListNode* FindList(ListNode* pre, ListNode* cur){
    if (cur == nullptr){
        new_list = pre;
        return new_list;
    }

    ListNode* tmp =  FindList(cur, cur->next);
    tmp->next = pre;

    return pre;
}

ListNode* reverseList(ListNode* head) {
    FindList(NULL, head);

    return new_list;
    
}

};