Merge Two Sorted Lists
EasyAcceptance: 60.3%
Merge two sorted linked lists and return it as a sorted list.
Examples:
Input: l1 = [1,2,4], l2 = [1,3,4]
Output: [1,1,2,3,4,4]
Explanation: The lists are merged in sorted order.
Constraints:
- The number of nodes in both lists is in the range [0, 50]
- -100 <= Node.val <= 100
- Both l1 and l2 are sorted in non-decreasing order
Loading...