class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int []merge=new int[n+m];
      int i=0, j=0, k=0;
while(i<n && j<m){
	if(nums1[i]<nums2[j]){
		merge[k]=nums1[i];
		k++; i++;
	}
	else {
		merge[k]=nums2[j];
		k++; j++;
	}
}

while(i<n)merge[k++]=nums1[i++];
while(j<m)merge[k++]=nums2[j++];

        for(i=0;i<n+m;i++)nums1[i]=merge[i];
    }
}