We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
My Java solution with linear time complexity and constant space complexity:
publicstaticDoublyLinkedListNodereverse(DoublyLinkedListNodellist){//return llist if its null, indicating the llist is emptyif(llist==null)returnllist;//use a curr ptrDoublyLinkedListNodecurr=llist;//iterate thru the llistwhile(curr!=null){//store curr nxt in a temp varDoublyLinkedListNodetemp=curr.next;curr.next=curr.prev;curr.prev=temp;if(temp==null)break;elsecurr=temp;}returncurr;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Reverse a doubly linked list
You are viewing a single comment's thread. Return to all comments →
My Java solution with linear time complexity and constant space complexity: