Leetcode: Merge Sorted Array

 1 public class Solution {
 2     public void merge(int A[], int m, int B[], int n) {
 3         int j = m - 1, k = n - 1;
 4         for (int i = m+n-1; i >= 0; i--) {
 5             if (j >= 0 && k >= 0){
 6                 if (A[j] >= B[k]) {
 7                     A[i] = A[j];
 8                     j--;
 9                 }
10                 else {
11                     A[i] = B[k];
12                     k--;
13                 }
14             }
15             else if (k >= 0) {
16                 A[i] = B[k];
17                 k--;
18             }
19         }
20     }
21 }