Package g0001_0100.s0088_merge_sorted_array

Class Solution

java.lang.Object

g0001_0100.s0088_merge_sorted_array.Solution

public class Solution
extends Object

88 - Merge Sorted Array.<p>Easy</p> <p>You are given two integer arrays <code>nums1</code> and <code>nums2</code>, sorted in <strong>non-decreasing order</strong> , and two integers <code>m</code> and <code>n</code>, representing the number of elements in <code>nums1</code> and <code>nums2</code> respectively.</p> <p><strong>Merge</strong> <code>nums1</code> and <code>nums2</code> into a single array sorted in <strong>non-decreasing order</strong>.</p> <p>The final sorted array should not be returned by the function, but instead be <em>stored inside the array</em> <code>nums1</code>. To accommodate this, <code>nums1</code> has a length of <code>m + n</code>, where the first <code>m</code> elements denote the elements that should be merged, and the last <code>n</code> elements are set to <code>0</code> and should be ignored. <code>nums2</code> has a length of <code>n</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3</p> <p><strong>Output:</strong> [1,2,2,3,5,6]</p> <p><strong>Explanation:</strong> The arrays we are merging are [1,2,3] and [2,5,6]. The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums1 = [1], m = 1, nums2 = [], n = 0</p> <p><strong>Output:</strong> [1]</p> <p><strong>Explanation:</strong> The arrays we are merging are [1] and []. The result of the merge is [1].</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums1 = [0], m = 0, nums2 = [1], n = 1</p> <p><strong>Output:</strong> [1]</p> <p><strong>Explanation:</strong> The arrays we are merging are [] and [1]. The result of the merge is [1]. 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.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>nums1.length == m + n</code></li> <li><code>nums2.length == n</code></li> <li><code>0 <= m, n <= 200</code></li> <li><code>1 <= m + n <= 200</code></li> <li><code>-10⁹ <= nums1[i], nums2[j] <= 10⁹</code></li> </ul> <p><strong>Follow up:</strong> Can you come up with an algorithm that runs in <code>O(m + n)</code> time?</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
void	merge(int[] nums1, int m, int[] nums2, int n)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

merge

public void merge(int[] nums1,
 int m,
 int[] nums2,
 int n)