Merge Two Sorted Lists
You are given the heads of two sorted linked lists, list1 and list2.
Merge the two lists into one sorted linked list. The merged list should be made by splicing together the nodes of the first two lists.
Return the head of the merged linked list.
Example 1
[1] -> [2] -> [4] -> null [1] -> [3] -> [4] -> null --- [1] -> [1] -> [2] -> [3] -> [4] -> [4] -> null
Input
list1 = [1,2,4], list2 = [1,3,4]Output
[1,1,2,3,4,4]Merging the two sorted lists produces the sorted sequence 1, 1, 2, 3, 4, 4.
Example 2
null null --- null
Input
list1 = [], list2 = []Output
[]Both lists are empty, so the merged list is also empty.
Constraints
- The number of nodes in both lists is in the range [0, 50]
- -100 <= Node.val <= 100
- Both
list1andlist2are sorted in non-decreasing order