數(shù)組1：[5, 6, 7, 8]
數(shù)組2：[1, 7, 9]
結(jié)果數(shù)組：[1, 5, 6, 7, 7, 8, 9]
/**
* 合并兩個有序數(shù)組
* @param args0
* @param args1
*/
public static void sort(int[] args0,int[] args1) {
//args0數(shù)組下標
int a = 0;
//args1數(shù)組下標
int b = 0 ;
int len = args0.length + args1.length;
//結(jié)果數(shù)組
int[] result = new int[len];
for (int i = 0; i < len; i++) {
//默認值為最大值
int numA =Integer.MAX_VALUE;
int numB =Integer.MAX_VALUE;
if (a < args0.length){
numA = args0[a];
}
if (b < args1.length){
numB = args1[b];
}
if (numA >= numB){
result[i] = numB;
b++;
}else {
result[i] = numA;
a++;
}
}
System.out.println(Arrays.toString(result));
}
