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.

[code]

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