Merge Sorted Array

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int res[] = new int[m + n];
        int pm = 0;
        int pn = 0;
        int i = 0;

        for (; i < m + n; i++) {

            if (pm == m) {
                if (pn == n) {
                    break;
                } else {
                    res[i] = B[pn];
                    pn++;
                }
            } else if (pn == n) {
                if (pm == m) {
                    break;
                } else {
                    res[i] = A[pm];
                    pm++;
                }
            } else {
                res[i] = (A[pm] > B[pn] ? B[pn] : A[pm]);
                if (A[pm] > B[pn]) {
                    pn++;
                } else {
                    pm++;
                }
            }
        }

        for (int j = 0; j < m + n; j++) {
            A[j] = res[j];
        }

    }
}