0088. Merge Sorted Array.md

Two Pointers

C++

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        for(int i = 0; i < n; i++) {
            nums1[i + m] = nums2[i];
        }
        return sort(nums1.begin(), nums1.end());
    }
};

JS

/**
 * @param {number[]} nums1
 * @param {number} m
 * @param {number[]} nums2
 * @param {number} n
 * @return {void} Do not return anything, modify nums1 in-place instead.
 */
var merge = function(nums1, m, nums2, n) {
    for(let i = 0; i < n; i++) {
        nums1[i + m] = nums2[i];
    }
    nusm1 = nums1.sort((a, b) => a - b);
};

Time Complexity: O((N+M)Log(N+M))
Space Complexity: O(1)