{"id":496,"date":"2024-08-06T02:26:42","date_gmt":"2024-08-06T02:26:42","guid":{"rendered":"https:\/\/premsvmm.com\/?p=496"},"modified":"2024-08-06T02:26:42","modified_gmt":"2024-08-06T02:26:42","slug":"merge-sorted-array","status":"publish","type":"post","link":"https:\/\/premsvmm.com\/index.php\/2024\/08\/06\/merge-sorted-array\/","title":{"rendered":"Merge Sorted Array"},"content":{"rendered":"\n

You are given two integer arrays nums1<\/code> and nums2<\/code>, sorted in non-decreasing order<\/strong>, and two integers m<\/code> and n<\/code>, representing the number of elements in nums1<\/code> and nums2<\/code> respectively.<\/p>\n\n\n\n

Merge<\/strong> nums1<\/code> and nums2<\/code> into a single array sorted in non-decreasing order<\/strong>.<\/p>\n\n\n\n

The final sorted array should not be returned by the function, but instead be stored inside the array <\/em>nums1<\/code>. To accommodate this, nums1<\/code> has a length of m + n<\/code>, where the first m<\/code> elements denote the elements that should be merged, and the last n<\/code> elements are set to 0<\/code> and should be ignored. nums2<\/code> has a length of n<\/code>.<\/p>\n\n\n\n

Example 1:<\/strong>Input:<\/strong> nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3 Output:<\/strong> [1,2,2,3,5,6] 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>\n\n\n\n

Example 2:<\/strong>Input:<\/strong> nums1 = [1], m = 1, nums2 = [], n = 0 Output:<\/strong> [1] Explanation:<\/strong> The arrays we are merging are [1] and []. The result of the merge is [1].<\/p>\n\n\n\n

Example 3:<\/strong>Input:<\/strong> nums1 = [0], m = 0, nums2 = [1], n = 1 Output:<\/strong> [1] 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>\n\n\n\n

Constraints:<\/strong><\/p>\n\n\n\n