88_Merge_Sorted_Array.cpp

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

/**
 * @brief The Solution class
    Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

    Note:
    The number of elements initialized in nums1 and nums2 are m and n respectively.
    You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.

    Example:

    Input:
    nums1 = [1,2,3,0,0,0], m = 3
    nums2 = [2,5,6],       n = 3

    Output: [1,2,2,3,5,6]
 */
using namespace std;

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int indmer=m+n-1, ind1=m-1, ind2=n-1;
        while(ind1>=0 && ind2>=0)
        {
            if(nums1.at(ind1) < nums2.at(ind2))
                nums1[indmer--] = nums2.at(ind2--);
            else
                nums1[indmer--] = nums1.at(ind1--);
        }
        while(ind2>=0)
            nums1[indmer--] = nums2.at(ind2--);
    }

    void test(vector<int> &nums1, int m, vector<int>& nums2, int n)
    {
        merge(nums1, m, nums2, n);
        for(int i=0; i<m+n; i++)
            cout << nums1.at(i) << ",";
        cout << endl;
    }
};

int main()
{
    vector<vector<int>> arr1 = {{1,2,3,0,0,0}};
    vector<int> numofarr1 = {3};
    vector<vector<int>> arr2 = {{2,5,6}};
    vector<int> numofarr2 = {3};
    for(size_t i=0; i<arr1.size(); i++)
    {
        Solution example;
        example.test(arr1.at(i), numofarr1.at(i), arr2.at(i), numofarr2.at(i));
    }
    return 0;
}