class Solution { public: void merge(int A[], int m, int B[], int n) { for(int i = m, j = 0; i < m + n , j < n; i ++ , j ++ ) { A[i] = B[j]; } sort(A, A + m + n);
}
};

class Solution { public: void merge(int A[], int m, int B[], int n) { for(int i = m, j = 0; i < m + n , j < n; i ++ , j ++ ) { A[i] = B[j]; } sort(A, A + m + n);
}
};