Solution: Reverse a LinkedList

Problem Statement

Given the head of a Singly LinkedList, reverse the LinkedList. Write a function to return the new head of the reversed LinkedList.

Constraints:

The number of nodes in the list is the range [0, 5000].
-5000 <= Node.val <= 5000

Solution

To reverse a LinkedList, we need to reverse one node at a time. We will start with a variable current which will initially point to the head of the LinkedList and a variable previous which will point to the previous node that we have processed; initially previous will point to null.

.....

Like the course? Get enrolled and start learning!

Manuel

· 2 years ago



class Solution {

    public ListNode reverse(ListNode head) {
     return performReverse(null, head);
  }

  private ListNode performReverse(ListNode previous, ListNode current ){
	  if (current==null) {
	    return previous;
	  }
	    ListNode next = current.next;
	    current.next = previous;
	    return performReverse( current,next);
   }
}