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.

class Solution 
{
public:
    void merge(int A[], int m, int B[], int n) 
    {
        int i=m-1;
        int j=n-1;
        int loc = m+n-1;
        while(i>=0 || j>=0)
        {
            if(j<0)
                A[loc--] = A[i--];
            else if(i<0)
                A[loc--] = B[j--];
            else if(A[i] > B[j])
                A[loc--] = A[i--];
            else
                A[loc--] = B[j--];
        }
    }
};

LeetCode--Merge Sorted Array