LeetCode Merge Sorted Array

// 32ms
 1 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
        int i,j,k;
        for(i=m-1;i>=0;i--)
        {
            A[i+n]=A[i];
        }
        i=n;
        j=0;
        k=0;
        while(i<m+n&&j<n)
        {
            if(A[i]<=B[j])
            {
                A[k]=A[i];
                k++;
                i++;
            }
            else
            {
                A[k]=B[j];
                k++;
                j++;
            }
        }
        while(j<n)
        {
            A[k]=B[j];
            k++;
            j++;
        }
    }
};