class Solution {
public:
void merge(int A[], int m, int B[], int n) {
int i = m - 1;
int j = n - 1;
int index = m + n - 1;
while(i >= 0 && j >= 0){
A[index--] = A[i] > B[j] ? A[i--] : B[j--];
}
while(j >= 0){
A[index--] = B[j--];
}
}
};
08-10
5192
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
08-10
08-10
06-06