Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
int end = m+n-;
m--;
n--;
while(m >= && n >= )
{
if(A[m] < B[n])
{
A[end--] = B[n--];
}
else
{
A[end--] = A[m--];
}
}
while(n>=)
{
A[end--] = B[n--];
}
}
};