Leetcode: Merge Sorted Arrays

class Solution {
public:
    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)
          //  return;
        int mover=m+n-1;
        --m;
        --n;
        while(m>=0&&n>=0){
            if(A[m]>=B[n]){
                A[mover]=A[m];
                --mover;
                --m;
            } else {
                A[mover]=B[n];
                --mover;
                --n;
            }
        }
        while(m>=0){
            A[mover]=A[m];
            --mover;
            --m;
        }
        while(n>=0){
            A[mover]=B[n];
            --mover;
            --n;
        }
    }
};