/** * 问题6.有序数组 A1 A2 的合并 */ @Test public void orderArrayMerge() { // 两个有序数组 A1 A2 的合并 int[] A1 = {1, 5, 7, 8, 9, 12, 20, 39, 0, 0, 0, 0, 0, 0, 0}; int[] A2 = {3, 5, 7, 13, 15, 23, 45}; int A1A2Index = A1.length - 1; int A1Rear = A1.length - A2.length