88_MergeSortedArray - a920604a/leetcode GitHub Wiki

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {        
        for(int i=m , j=0; i<m+n && j<n;++i, j++){
            // insert sort
            int key = nums2[j];
            int k = i-1;
            while(k>-1 && nums1[k]>key){
                nums1[k+1] = nums1[k];
                k--;
            }
            nums1[k+1] = key;
        }
        
    }
};

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        // merge sort
        int l = 0, r = 0, i=0;
        vector<int> nums(m+n,0);
        while(l<m && r<n){
            if(nums1[l] < nums2[r]) nums[i] = nums1[l++];
            else nums[i] = nums2[r++];
            i++;
        }
        while(l<m) nums[i++] = nums1[l++];
        while(r<n) nums[i++] = nums2[r++];
        nums1 = nums;
    }
};

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        vector<int> ret(nums1.begin(), nums1.begin() + m);
        
        int i =0, j=0;
        int k=0;
        while(i<m && j<n)
        {
            if(ret[i]< nums2[j])
            {
                nums1[k++] = ret[i++];
            }
            else{
                nums1[k++] = nums2[j++];
            }
        }
        while(i<m) nums1[k++] = ret[i++];
        while(j<n) nums1[k++] = nums2[j++];
        
    }
};