leetcode_question_88 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 to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

void merge(int A[], int m, int B[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(A == NULL)return;
    	if(B == NULL || n == 0)return;
		int length = m+n-1;
		--m;
		--n;
		while(n >= 0 && m >= 0)
		{
			if(A[m] > B[n])A[length--] = A[m--];
			else A[length--] = B[n--];
		}
		while(m>=0)
			A[length--] = A[m--];
		while(n>=0)
			A[length--] = B[n--];
    }