Merge Two Sorted Lists

• 

  Submission Link : https://leetcode.com/problems/merge-two-sorted-lists/submissions/876551164/

You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.

Example :

List 1 : 1 -> 2 -> 4 List 2 : 1 -> 3 -> 4

Output : 1 -> 1 -> 2 -> 3 -> 4 -> 4

Code : ` ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { ListNode n(INT_MIN); ListNode *tail = &n;

    while (l1 && l2) {
        if (l1->val < l2->val) {
            tail->next = l1;
            l1 = l1->next;
        } else {
            tail->next = l2;
            l2 = l2->next;
        }
        tail = tail->next;
    }

    tail->next = l1 ? l1 : l2;
    return n.next;
}

`

Built With

• c++
• cpp