You are viewing a single comment's thread. Return to all comments →
Java Solution
static SinglyLinkedListNode mergeLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {
SinglyLinkedList singlyLinkedList = new SinglyLinkedList(); while(head1!=null||head2!=null){ if(head1!=null&&head2!=null){ if(head1.data>head2.data){ singlyLinkedList.insertNode(head2.data); head2=head2.next; }else{ singlyLinkedList.insertNode(head1.data); head1=head1.next; } }else if(head1!=null&&head2==null){ singlyLinkedList.insertNode(head1.data); head1=head1.next; }else if(head1==null&&head2!=null){ singlyLinkedList.insertNode(head2.data); head2=head2.next; } } return singlyLinkedList.head; }
Seems like cookies are disabled on this browser, please enable them to open this website
Merge two sorted linked lists
You are viewing a single comment's thread. Return to all comments →
Java Solution
static SinglyLinkedListNode mergeLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {