'''

class Solution {

public void merge(int[] nums1, int m, int[] nums2, int n) {

```
int len1 = m;
int count1 = 0;
int count2 = 0;
while (n != 0 && m != 0) {
if (nums1[count1] <= nums2[count2]) {
count1++;
m--;
} else {
for (int k = len1 + count2; k > count1; k--) {
nums1[k] = nums1[k-1];
}
nums1[count1] = nums2[count2];
count1++;
count2++;
n--;
}
}
if (n != 0) {
while (n != 0) {
nums1[count1] = nums2[count2];
count1++;
count2++;
n--;
}
}
}
```

}

'''