【LeetCode 面试经典150题】88. Merge Sorted Array 合并两个有序数组

88. 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 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.

中文释义

你给定了两个整数数组 nums1 和 nums2，它们按非递减顺序排序，以及两个整数 m 和 n，分别代表 nums1 和 nums2 中的元素数量。

将 nums1 和 nums2 合并成一个按非递减顺序排序的单一数组。

最终排序的数组不应该由函数返回，而是应该存储在 nums1 数组内。为了适应这一点，nums1 的长度为 m + n，其中前 m 个元素表示应该合并的元素，而最后 n 个元素设置为0，应该被忽略。nums2 的长度为 n。

Example 1:

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