赵二的刷题日记050《反转链表》

Reverse Linked List

Given the head of a singly linked list, reverse the list, and return the reversed list.

Example 1:

Input: head = [1,2,3,4,5]
Output: [5,4,3,2,1]

Example 2:

Input: head = [1,2]
Output: [2,1]

Example 3:

Input: head = []
Output: []

/**
 * 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 rev(head);
    }
    
    public ListNode rev(ListNode head) {
        if (head == null || head.next == null) {
            return head;
        }
        
        ListNode newHead = rev(head.next);
        head.next.next = head;
        head.next = null;
        
        
        return newHead;
    }
}