[LeetCode] Merge Sorted Array

Total Accepted: 11913 Total Submissions: 37576

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 nrespectively.

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int j = m - 1;
        int k = n - 1;
        
        // merge backward to avoid moving elements
        for (int i = m + n - 1; i >= 0; i--) {
            if      (j < 0)         A[i] = B[k--];
            else if (k < 0)         A[i] = A[j--];
            else if (A[j] >= B[k])  A[i] = A[j--];
            else                    A[i] = B[k--];
        }
    }
}