Merge Two Sorted Lists
Easy
Two Pointers
Linked List
Merge
Sorting
You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a sorted manner and return the head of the merged linked list. The list should be made by splicing together the nodes of the first two lists. For this problem, represent linked lists as arrays.
Examples:
Input:
[[1,2,4],[1,3,4]]Output:
[1,1,2,3,4,4]Input:
[[],[]]Output:
[]Input:
[[],[0]]Output:
[0]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.
Code Editor
Loading advanced editor...
Console Output
Ready to execute
Click "Run Code" to see your output here