LeetCode Merge Sorted Array

Given two sorted integer arrays A and B, merge B into A as one sorted array.

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

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int[] newA=new int[m+n];
        int indexA = 0,indexB=0;
        int i=0;
        while (indexA<m && indexB<n) {
            if (A[indexA]<B[indexB]) {
                newA[i]=A[indexA];
                indexA++;
            }else {
                newA[i]=B[indexB];
                indexB++;
            }
            ++i;
        }
        if (indexA==m) {
            for (int j = indexB; j < n; j++) {
                newA[i]=B[j];
                ++i;
            }
        }
        if (indexB==n) {
            for (int j = indexA; j < m; j++) {
                newA[i]=A[j];
                ++i;
            }
        }
        
        for (int j = 0; j < m+n; j++) {
            A[j]=newA[j];
        }
        
    }
}