Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has enough space (size that is equal to m + n) to hold additional elements from nums2.
Example 1:
1 | Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3 |
Example 2:
1 | Input: nums1 = [1], m = 1, nums2 = [], n = 0 |
合併2個已經排序過array,也有給出合併起始m,那就把第二個array添到第一個m之後再sort
如果你覺得這篇文章很棒,請你不吝點讚 (゚∀゚)