Walk through the list with three references: one for the previous node, one for the current node, and one to temporarily hold the next node.

Reverse Linked List

easy

Acceptance: 69%

Linked List

Take a singly linked list and reverse the direction of every link so that the last node becomes the new head and the original head becomes the tail. Return the new head of the reversed list.

Examples

Example 1:

Input:head = [10,20,30,40]

Output:[40,30,20,10]

Example 2:

Input:head = [7,3]

Output:[3,7]

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Reverse Linked List

Examples

Hints

Related Problems