Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. example:Input: nums1 = [1,2,3,0,0,0], m = 3 nums2 = [2,5,6], n = 3 Output: [1,2,2,3,5,6]
Brick409/LeetCode88_Merge-Sorted-Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. example:Input: nums1 = [1,2,3,0,0,0], m = 3 nums2 = [2,5,6], n = 3 Output: [1,2,2,3,5,6]
C++