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

during the judging there is a test case :[0] 0 [1] 1 i was wondering that the num of elemnets for nums1 should be 1 right? Though the element is 0 but it's still make a count. any one could help answer my confusion? thanks (: