Merge two sorted lists
Easyarraytwo pointerssorting
Given two ascending arrays, return one sorted array with every element, in O(n + m) (without sorting again).
Example 1
Input: a = [1,2,3], b = [2,5,6] Output: [1,2,2,3,5,6]
Example 2
Input: a = [], b = [1] Output: [1]
Constraints
- 0 ≤ a.length, b.length ≤ 10⁴
- Both are sorted
Submit checks your solution against 7 tests, including hidden ones.
/**
* @param {int[]} a
* @param {int[]} b
* @return {int[]}
*/
function mergeSorted(a, b) {
}