Leetcode[Easy] - Merge Sorted Array

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
       int currentA = m-1; int currentB = n-1; int k = m+n-1;
       while(currentA >= 0 && currentB >= 0)
             A[k--] = A[currentA]>B[currentB] ? A[currentA --] : B[currentB--];
       
      while(currentB >=0 || currentA >=0 )
            A[k--] = currentA < 0 ? B[currentB--]:A[currentA--];
    }

}

------

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 mand n respectively.