37. Merge Two Sorted Lists

Easy · Linked List

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 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: The two lists are merged into one sorted list by comparing nodes from each list and appending the smaller one.
Example 2
Input: list1 = [], list2 = [0]
Output: [0]
Explanation: When one list is empty, the result is simply the other list.

Constraints