class Solution { public: void merge(int A[], int m, int B[], int n) { int index1=m+n-1; int a=m-1; int b=n-1; if(n==0){ return ; } while(a>=0&&b>=0){ if(A[a]>B[b]){ A[index1--]=A[a--]; ...