Merge Sorted Array
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2, respectively.
Merge nums1 and nums2 into a single array sorted in non-decreasing order.
The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where:
- The first
melements denote the elements that should be merged. - The last
nelements are set to0and should be ignored.
nums2 has a length of n.
Follow up: Can you come up with an algorithm that runs in O(m + n) time?
Example 1
Input
nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3Output
[1,2,2,3,5,6]The arrays being merged are [1, 2, 3] and [2, 5, 6], resulting in [1, 2, 2, 3, 5, 6].
Example 2
Input
nums1 = [1], m = 1, nums2 = [], n = 0Output
[1]The arrays being merged are [1] and [], so the result remains [1].
Constraints
- nums1.length == m + n
- nums2.length == n
- 0 <= m, n <= 200
- 1 <= m + n <= 200
- -10^9 <= nums1[i], nums2[j] <= 10^9
Asked at 38 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.