翻转链表（双指针+递归）Java

给你单链表的头节点 head ，请你反转链表，并返回反转后的链表。

 

 双指针：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode prev=null;
        ListNode cur=head;
        ListNode temp=null;
        while(cur!=null){
            temp=cur.next;
            cur.next=prev;
            prev=cur;
            cur=temp;

        }
        return prev;
    }
}

递归：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
       
        return find(null,head);
    }
    private ListNode find(ListNode prev,ListNode cur){
        if(cur==null) return prev;

        ListNode temp=null;
        temp=cur.next;
        cur.next=prev;
        prev=cur;
        cur=temp;
        return find(prev,cur);
    }
}