A. Merge Sorted Array (two brushes, a concise notation)

Given sorted integer Arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:
Assume that nums1 have enough space (size that's greater or equal to M + N) to hold additional elements from NUMS2 . The number of elements initialized in Nums1 and Nums2 is M and N respectively.

Subscribe to see which companies asked this question

AC Code:

Class Solution {
Public:
    void merge (vector<int>& nums1, int m, vector<int>& n UMS2, int n) {
        int i=m-1,j=n-1,k=m+n-1;
        while (j>=0)
        {
            nums1[k--]= (i>=0&&nums1[i]>nums 2[J])? nums1[i--]:nums2[j--];
       }
       //return nums1;
   }
};