Please help C-program Given: Two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array and return the sorted array as a new array. The number of elements initialized in...

Please help C-program

Given:
Two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array and return the sorted array as a new array.

The number of elements initialized in nums1 and nums2 are
m
and
n
respectively

Input: nums1 = [1], m = 1, nums2 = [], n = 0 Output: [1]

Constraints:

nums1.length == m + n

nums2.length == n

0 <= m,="" n=""><=>

1 <= m="" +="" n=""><=>

-109 <= nums1[i],="" nums2[i]=""><=>

Jun 06, 2022

Get Answer To This Question