Merge Sorted Array

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        vector<int> res;
        int i , j , k;
        if(nums2.size() == 0) return;
        for(i = 0 , j = 0 , k = 0 ; i < m+n-1 && j<m && k <n; ){
            if(nums1[j] <= nums2[k]){
                //cout<<nums1[j]<<endl;
                res.push_back(nums1[j]); 
                j++;
            }
            else{
                res.push_back(nums2[k]);
                k++;
            }
        }
        while(j <m){
            res.push_back(nums1[j]);
            j++;
        }
        while( k <n){
            res.push_back(nums2[k]);
            k++;
        }
        nums1 = res;
    }
};