合并两个有序数组(c#)

问题描述

给定两个非递减的整型数组，数组中数据的个数别为m,n。
数组1的大小为m+n，前面存放m个数据，后面存放n个0。数组2存放n个数据。
将数组2合并到数组1,并其数组1仍然保持非递增的顺序。

---

示例

• 示例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.

• 示例2

Input: nums1 = [1], m = 1, nums2 = [], n = 0
Output: [1]
Explanation: The arrays we are merging are [1] and [].
The result of the merge is [1].

• 示例3

Input: nums1 = [0], m = 0, nums2 = [1], n = 1
Output: [1]
Explanation: The arrays we are merging are [] and [1].
The result of the merge is [1].
Note that because m