136. Merge Two Sorted Lists
Core1000 ms256 MBSolved by 0%
Read two sorted lists, n and its values, then m and its values, and
merge them into one sorted list, printing the result.
Print Empty if both are empty. Merge by relinking the existing nodes in one pass rather
than collecting the values and sorting.
Constraints - `0 ≤ n, m ≤ 100000` - `-1000000 ≤ value ≤ 1000000` - Both lists are sorted ascending.
Input
The first line contains n, then a line of n integers, the first list.
The next line contains m, then a line of m integers, the second list.
Both lists are already sorted ascending. The starter code builds both lists for you.
Output
Print the merged list from head to tail on ONE line, separated by single spaces, or Empty if both lists are empty.
Input3
1 3 5
3
2 4 6
Output1 2 3 4 5 6
Noteinterleaves the two lists evenly
Input2
1 2
0
Output1 2
Notehas an empty second list, so the first passes through unchanged
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.