You are viewing a single comment's thread. Return to all comments →
My Java solution with linear time complexity and constant space complexity:
static boolean compareLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) { if(head1 == null && head2 == null) return true; while(head1 != null && head2 != null){ if(head1.data != head2.data) return false; head1 = head1.next; head2 = head2.next; } return head1 == head2; }
Seems like cookies are disabled on this browser, please enable them to open this website
Compare two linked lists
You are viewing a single comment's thread. Return to all comments →
My Java solution with linear time complexity and constant space complexity: