public class Solution { public void merge(int A[], int m, int B[], int n) { int alen = m - 1; int blen = n - 1; int len = m + n - 1; /** * 情况1: * A: [4,5,6,0,0,0] * B: [1,2,3] * 第一个while运行后:alen=-1 blen=3 * A: [0,0,,4,5,6] * B: [1,2,3] * 第二个white循环后: blen=-1 * A: [1,2,3,4,5,6] * * 情况2: * A: [1,2,3,0...