题目
合并两个已经有序的数组
合并前:
int[] A = new int[]{1, 5, 10, 35, 80};
int[] B = new int[]{2, 9, 20, 30, 70};
合并后:
int[] C = new int[]{1, 2, 5, 9, 10, 20, 30, 35, 70, 80};
解题思路
1, 创建两个分别对应两个数组的两个指针,和一个新数组C存放最终结果
private static int[] merge(int[] A, int[] B) {
int a = 0;
int b = 0;
int[] c = new int[]{A.length + B.length};
}
2,遍历最长的C对其赋值,case1,两个指针没有扫描完对应的集合
private static int[] merge(int[] A, int[] B) {
int a = 0;
int b = 0;
int[] C = new int[]{A.length + B.length};
for (int i = 0; i < C.length; i++) {
if (a < A.length && b < B.length) {