在java中使用temp变量递归地反转链表。

class ListNode {
    int val;
    ListNode next;
    
    ListNode(int val) {
        this.val = val;
    }
}

public ListNode reverseList(ListNode head) {
    if (head == null || head.next == null) {
        return head;
    }
    
    ListNode temp = reverseList(head.next);
    head.next.next = head;
    head.next = null;
    
    return temp;
}

public static void main(String[] args) {
    ListNode head = new ListNode(1);
    head.next = new ListNode(2);
    head.next.next = new ListNode(3);
    head.next.next.next = new ListNode(4);
    head.next.next.next.next = new ListNode(5);
    
    ListNode reversedHead = reverseList(head);
    
    // 输出反转后的链表
    while (reversedHead != null) {
        System.out.print(reversedHead.val + " ");
        reversedHead = reversedHead.next;
    }
}