Merge Sorted Array

/*

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.
*/

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(n<=0) return;
        int i;
        if(m<=0 && n>0){
          for(i=0; i<n; i++){
            A[i] = B[i];
          }
          return; 
        }
        //case 1 : A[0] >= B[n-1]
        if(A[0] >= B[n-1]){
           for(i=n+m-1; i>=n; i--){
             A[i] = A[i-n];
           }
           for(i=0; i<n; i++){
             A[i] = B[i];
           }
           return;
        }
       
        if(B[0]>=A[m-1]){
          for(i=m; i<=n+m-1; i++){
            A[i] = B[i-m];
          }
          return;
        }
       
        int posA = m-1;
        int posB = n-1;
        i = n+m-1;
        while(i>=0 && posA>=0 && posB>=0){
           if(A[posA]>B[posB]){
              A[i] = A[posA];
              posA--;
           }
           else{
              A[i] = B[posB];
              posB--;
           }
           i--;
        }
        if(posB>=0){
          for(i=0; i<=posB; i++){
            A[i] = B[i];
          }
        }
       
        return;
    }
};