题解 | #合并两个有序的数组#
合并两个有序的数组
https://www.nowcoder.com/practice/89865d4375634fc484f3a24b7fe65665
import java.util.*;
public class Solution {
public void merge(int A[], int m, int B[], int n) {
int a = m - 1;
int b = n - 1;
int k = m + n - 1;
while (a >= 0 && b >= 0) {
if (A[a] > B[b]) {
A[k--] = A[a--];
} else {
A[k--] = B[b--];
}
}
if(a<0){
while(b>=0){
A[k--] = B[b--];
}
}
}
}
