Sort 97 Discussions, By:

1 week ago+ 0 comments

No starter code for Go.

2 weeks ago+ 0 comments

#Python
def mergeLists(head1, head2):
    data = []
    linked_list = SinglyLinkedList()
    while(head1!= None):
        data.append(head1.data)
        head1 = head1.next
    while(head2!= None):
        data.append(head2.data)
        head2 = head2.next
    data.sort()
    for item in data:
        linked_list.insert_node(item)
    return linked_list.head

3 weeks ago+ 0 comments

C++

SinglyLinkedListNode* mergeLists(SinglyLinkedListNode* head1, SinglyLinkedListNode* head2) {
    if (head2 == nullptr) {
        return head1;
    }
    
    if (head1 == nullptr) {
        return head2;
    }
    
    SinglyLinkedListNode* result;
    if (head1->data <= head2->data) {
        result = head1;
        result->next = mergeLists(head1->next, head2);
    } else {
        result = head2;
        result->next = mergeLists(head1, head2->next);
    }
    
    return result;
}

3 weeks ago+ 0 comments

JAVA

Merge two sequence and sort it by "sorting by insert".

static SinglyLinkedListNode mergeLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {

    // Create new list.
    SinglyLinkedList list = new SinglyLinkedList(); 

    // Merge sequence1 with list;
    SinglyLinkedListNode head = head1;
    while(head != null){
       list.insertNode(head.data);
       head = head.next;
    }

    // Merge sequence2 with list;
    head = head2;
    while(head != null){
       list.insertNode(head.data);
       head = head.next;
    }

    // First node.
    SinglyLinkedListNode input = list.head;

    // Anchor.
    SinglyLinkedListNode sentinel = new SinglyLinkedListNode(0);

    // Do while all items wont be added to sequence.
    while(input != null){

        // next to add.
       SinglyLinkedListNode next = input;

       // set new value to next iteration.
       input = input.next;


       SinglyLinkedListNode after = sentinel;
       while(after.next != null && after.next.data < next.data){
           after = after.next;
       }

       next.next = after.next;
       after.next = next;
   }

   return sentinel.next;
}

3 weeks ago+ 1 comment

highly appreciable, if someone minimize my if-else statements.

static SinglyLinkedListNode mergeLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {
        SinglyLinkedList sortedList = new SinglyLinkedList();
        int flag=0;
        SinglyLinkedListNode l1=head1,l2=head2;
        while(flag!=1){
            if(l1==null){
                sortedList.insertNode(l2.data);
                l2=l2.next;
            }else if(l2==null){
                sortedList.insertNode(l1.data);
                l1=l1.next;
            }else{
                if(l1.data<l2.data){
                    sortedList.insertNode(l1.data);
                    l1=l1.next;
                }else{
                    sortedList.insertNode(l2.data);
                    l2=l2.next;
                }
               
            }
            if(l1==null && l2==null){
                flag=1;
            }
        }
        return sortedList.head;
    }

Load more conversations