|
| 1 | +Merge Sorted Array |
| 2 | +Hint |
| 3 | +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. |
| 4 | + |
| 5 | +Merge nums1 and nums2 into a single array sorted in non-decreasing order. |
| 6 | + |
| 7 | +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 m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. |
| 8 | + |
| 9 | + |
| 10 | + |
| 11 | +Example 1: |
| 12 | + |
| 13 | +Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3 |
| 14 | +Output: [1,2,2,3,5,6] |
| 15 | +Explanation: The arrays we are merging are [1,2,3] and [2,5,6]. |
| 16 | +The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1. |
| 17 | +Example 2: |
| 18 | + |
| 19 | +Input: nums1 = [1], m = 1, nums2 = [], n = 0 |
| 20 | +Output: [1] |
| 21 | +Explanation: The arrays we are merging are [1] and []. |
| 22 | +The result of the merge is [1]. |
| 23 | +Example 3: |
| 24 | + |
| 25 | +Input: nums1 = [0], m = 0, nums2 = [1], n = 1 |
| 26 | +Output: [1] |
| 27 | +Explanation: The arrays we are merging are [] and [1]. |
| 28 | +The result of the merge is [1]. |
| 29 | +Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1. |
| 30 | + |
| 31 | + |
| 32 | +Constraints: |
| 33 | + |
| 34 | +nums1.length == m + n |
| 35 | +nums2.length == n |
| 36 | +0 <= m, n <= 200 |
| 37 | +1 <= m + n <= 200 |
| 38 | +-109 <= nums1[i], nums2[j] <= 109 |
| 39 | + |
| 40 | + |
| 41 | +Follow up: Can you come up with an algorithm that runs in O(m + n) time? |
0 commit comments