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 `nums2` into `nums1` as one sorted array.
The final sorted array should not be returned by the function, but instead be stored inside the array `nums1`.
checklist Constraints
nums1.length == m + n nums2.length == n 0 <= m, n <= 200 -10^9 <= nums1[i], nums2[j] <= 10^9
science Examples
Case #1
In:nums1 = [1,2,3,0,0,0]
m = 3
nums2 = [2,5,6]
n = 3