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.

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