题解 | #反转链表# 递归解决反转链表

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
  
    public ListNode ReverseList (ListNode head) {
        return reverseList(null,head);
    }

    //递归需要传入两个内容
    private ListNode reverseList (ListNode pre, ListNode cur) {
        if(cur==null){
            return pre;
        }
        ListNode next = cur.next;
        cur.next = pre;
        return reverseList(cur,next);
    }
}