Merge Sorted Array

https://leetcode.com/problems/merge-sorted-array/

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