Leetcode Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.

Difficulty: Easy

public class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        for(int i = m - 1; i >= 0; i--){
            nums1[n + i] = nums1[i];
        }
        int count1 = 0, count2 = 0;
        for(int i = 0; i < m + n; i++){
            if(count1 < m && count2 < n){
                if(nums1[count1 + n] > nums2[count2]){
                    nums1[i] = nums2[count2];
                    count2++;
                }
                else{
                    nums1[i] = nums1[count1 + n];
                    count1++;
                }
            }
            else if(count1 < m){
                nums1[i] = nums1[count1 + n];
                count1++; 
            }
            else{
                nums1[i] = nums2[count2];
                count2++;
            }
        }
        return;
        
    }
}