You are viewing a single comment's thread. Return to all comments →
SinglyLinkedListNode curr = llist; SinglyLinkedListNode prev = null; SinglyLinkedListNode nextnode = null;
if(curr.next!=null)
{
while(curr.next!=null) { nextnode = curr.next; curr.next = prev; prev = curr; curr=nextnode; }
}
if(curr.next==null) { curr.next = prev; prev = curr; }
return prev;
Seems like cookies are disabled on this browser, please enable them to open this website
Reverse a linked list
You are viewing a single comment's thread. Return to all comments →
SinglyLinkedListNode curr = llist; SinglyLinkedListNode prev = null; SinglyLinkedListNode nextnode = null;
if(curr.next!=null)
{
}
return prev;