ReverseLinkedList.java

/*
 LEETCODE QUESTION : 206. Reverse Linked List
 => Given the head of a singly linked list, reverse the list, and return the reversed list.
 */


// * Definition for singly-linked list.
publicclassListNode {
intval;
ListNodenext;

ListNode() {
 }

ListNode(intval) {
this.val = val;
 }

ListNode(intval, ListNodenext) {
this.val = val;
this.next = next;
 }
}

publicclassReverseLinkedList {

//Submit in leetcode from here :-
publicListNodereverseList(ListNodehead) {
if (head == null) {
returnhead;
 }
ListNodeprev = null;
ListNodepresent = head;
ListNodenextnode = present.next;

while (present != null) {
present.next = prev;
prev = present;
present = nextnode;
if (nextnode != null) {
nextnode = nextnode.next;
 }
 }
returnprev;

 }

}