Given the heads of two sorted linked lists, merge them into one sorted linked list.
Example 1:
Input: list1 = [1, 2, 4], list2 = [1, 3, 4]
Output: [1, 1, 2, 3, 4, 4]
Example 2:
Input: list1 = [], list2 = [0]
Output: [0]
linked-listTime: O(n+m)Space: O(1)Frequency: 5
Given the heads of two sorted linked lists, merge them into one sorted linked list.
Example 1:
Input: list1 = [1, 2, 4], list2 = [1, 3, 4]
Output: [1, 1, 2, 3, 4, 4]
Example 2:
Input: list1 = [], list2 = [0]
Output: [0]
sorting