Merge Two Sorted Lists

Medium~15 min

You are given the heads of two sorted linked lists list1 and list2.

Merge the two lists into 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.

Examples

Example 1
Input: list1 = [1, 2, 4], list2 = [1, 3, 4]
Output: [1, 1, 2, 3, 4, 4]
Explanation: Both lists are sorted, and we merge them into a single sorted list.
Example 2
Input: list1 = [], list2 = []
Output: []
Explanation: Both lists are empty, so the merged list is also empty.
Example 3
Input: list1 = [0], list2 = []
Output: [0]
Explanation: One list is empty, so we return the other list unchanged.

Constraints

  • The number of nodes in both lists is in the range [0, 50]
  • -100 <= Node.val <= 100
  • Both list1 and list2 are sorted in non-decreasing order
  • Expected time complexity: O(n + m)
Code
Ctrl+EnterRun|Ctrl+⇧+EnterSubmit
Output

Run your code to see results

Use Cmd+Enter to run