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 andn respectively.

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        while (m > 0 && n > 0) {
            if (A[m-1] < B[n-1]) {
                n--;
                A[m+n] = B[n];
            } else {
                m--;
                A[m+n] = A[m];
            }
        }
        while (n > 0) {
            n--;
            A[n] = B[n];
        }
    }
};</span>