MergeSortedArray.cpp

/*
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.

Merge nums1 and nums2 into a single array sorted in non-decreasing order.

The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.

*/


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

            v3.push_back(nums1[i]);
                i++;
                
            }   
        }
        
        while(i<m){
            v3.push_back(nums1[i]);
                i++; 
        }
        
          while(j<n){
            v3.push_back(nums2[j]);
                j++; 
        
              
    }
        nums1=v3;
           
       
        
    }
};