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.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Merge two sorted linked lists
  5. Discussions

Merge two sorted linked lists

Sort by

recency

|

987 Discussions

|

  • mazharnaqvi786
     + 0 comments

    Problem explanation is incorrect in the example. There is no 7 in either input LinkedList.

  • motaj21556
     + 0 comments

    Merging two sorted linked lists is a classic linked list problem, often asked in technical interviews and widely used in algorithms like merge sort. Cricbet99 Green Sign Up

  • polagorge
     + 0 comments
        static SinglyLinkedListNode mergeLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {

         SinglyLinkedListNode newList = null;

    if(head1.data < head2.data){
        newList = new SinglyLinkedListNode(head1.data);
        head1 = head1.next;
    }else{
        newList = new SinglyLinkedListNode(head2.data);
        head2 = head2.next;
    }

    var head = newList;

    while(head1 != null && head2 != null){

        if(head1.data < head2.data){
            newList.next = new SinglyLinkedListNode(head1.data);
            head1 = head1.next;
        }else{
            newList.next = new SinglyLinkedListNode(head2.data);
            head2 = head2.next;
        }
        newList = newList.next;
    }
    newList.next = (head1 != null) ? head1 : head2;


    return head;
}

  • gfigueroam
     + 0 comments

    Hi all, here my recursive solution in Java 8.

        static SinglyLinkedListNode mergeLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {
        if(head1== null && head2== null)
            return null;
        if(head1 == null)
            return head2;
        if(head2 == null) {
            return head1;
        }
        SinglyLinkedListNode result = null;
        if(head1.data< head2.data){
            result = head1;
            result.next = mergeLists(head1.next, head2);
        } else {
            result = head2;
            result.next = mergeLists(head1, head2.next);
        } 
        
        return result;
    }

  • jeelpatel779
     + 0 comments
        SinglyLinkedListNode* head=new SinglyLinkedListNode(0);
    SinglyLinkedListNode* temp=head;
    
    while(head1!=nullptr && head2!=nullptr){        
        if(head1->data<=head2->data){
            SinglyLinkedListNode* newNode=new SinglyLinkedListNode(head1->data);
            temp->next=newNode;
            head1=head1->next;
        }else {
            SinglyLinkedListNode* newNode=new SinglyLinkedListNode(head2->data);
            temp->next=newNode;
            head2=head2->next;
        }temp=temp->next;
    }
    while(head1!=nullptr){
        SinglyLinkedListNode* newNode=new SinglyLinkedListNode(head1->data);
        head1=head1->next;
        temp->next=newNode;
        temp=temp->next;
    }
    while(head2!=nullptr){
        SinglyLinkedListNode* newNode=new SinglyLinkedListNode(head2->data);
        head2=head2->next;
        temp->next=newNode;
        temp=temp->next;
    }head=head->next;
    return head;
}