Given the head of a singly linked list, reverse the list, and return the reversed list.
Input: head = [1,2,3,4,5]
Output: [5,4,3,2,1]
Code :
class Solution {
public ListNode reverseList(ListNode head) {
if(head==null||head.next==null)
return head;
ListNode nextnode=head.next;
ListNode newnode=reverseList(nextnode);
nextnode.next=head;
head.next=null;
return newnode;
}
}