Merge Two Sorted Lists
easyYou 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.
Example 1
Input: list1 = [1,2,4], list2 = [1,3,4]
Output: [1,1,2,3,4,4]
Explanation: Merging the two sorted lists yields 1->1->2->3->4->4.
Example 2
Input: list1 = [], list2 = []
Output: []
Explanation: Both lists are empty, so the result is an empty list.
Example 3
Input: list1 = [], list2 = [0]
Output: [0]
Explanation: One list is empty, so the result is just the other list.
Constraints
The number of nodes in both lists is in the range [0, 50].-100 <= Node.val <= 100Both list1 and list2 are sorted in non-decreasing order.
Loading editor...
Test Cases
Click "Run" to execute your code against test cases
← Reverse Linked ListNext →