88-Merge-Sorted-Array.cpp

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int left = m-1;
        int right = n-1;
        int merged = m+n-1;

        while(left >= 0 && right >= 0){
            if(nums1[left] > nums2[right]){
                nums1[merged--] = nums1[left--];
            }
            else{
                nums1[merged--] = nums2[right--];
            }
        }
        while(right >= 0){
            nums1[merged--] = nums2[right--];
        }
    }
};