You are given the heads of two sorted linked lists list1 and list2.
Merge the two lists into one sorted linked list and return the head of the new sorted linked list.
The new list should be made up of nodes from list1 and list2.
Example 1:
Input: list1 = [1,2,4], list2 = [1,3,5]
Output: [1,1,2,3,4,5]
Example 2:
Input: list1 = [], list2 = [1,2]
Output: [1,2]
Example 3:
Input: list1 = [], list2 = []
Output: []
Constraints:
0 <= The length of the each list <= 100.-100 <= Node.val <= 100
Examples
Example 1:
Input: list1 = [1,2,4], list2 = [1,3,5]
Output: [1,1,2,3,4,5]
Example 2:
Input: list1 = [], list2 = [1,2]
Output: [1,2]
Example 3:
Input: list1 = [], list2 = []
Output: []
Constraints
- `0 <= The length of the each list <= 100`.
- `-100 <= Node.val <= 100`
Prerequisites
- Singly Linked Lists(Data Structures & Algorithms for Beginners)
Target: O(N) time • O(1) spaceLinked List / Recursion
Socratic AI Tutor
Gemini 3.8 Flash
Loading editor...
Click "Run" or press Ctrl+Enter to execute test cases.