_21. Merge Two Sorted Lists.md

21. Merge Two Sorted Lists

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : May 22, 2024

Last updated : July 01, 2024

---

Related Topics : Linked List, Recursion

Acceptance Rate : 65.48 %

---

Solutions

• e21.java

Java

e21.java

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        if (list1 == null && list2 == null) {
            return null;
        }

        if (list1 == null && list2 != null) {
            return new ListNode(list2.val, mergeTwoLists(null, list2.next));
        } else if (list1 != null && list2 == null) {
            return new ListNode(list1.val, mergeTwoLists(list1.next, null));
        } else {
            if (list1.val < list2.val) {
                return new ListNode(list1.val, mergeTwoLists(list1.next, list2));
            } else {
                return new ListNode(list2.val, mergeTwoLists(list1, list2.next));
            }
        }

    }
}