public class Test8 {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr = { 1,7,9,10,13,15,17,19};
int[] brr = {2,4,6,8,10};
// 任意方式合并成一个数组
int[] crr = new int[arr.length + brr.length];
int[] drr = new int[arr.length + brr.length];
for (int i = 0; i < arr.length; i++) {
crr[i] = arr[i];
}
for (int j = 0; j < brr.length; j++) {
crr[arr.length + j] = brr[j];
}
for (int i = 0; i < crr.length; i++) {
System.out.print(crr[i] + "\t");
}
//按升序的方式合并成一个数组(课后作业) 先升序,后合并
/*
// Arrays.sort(crr);
int t = 0;
for (int i = 0; i < crr.length - 1; i++)
for (int j = 0; j < crr.length - 1 - i; j++)
if (crr[j] > crr[j + 1]) {
t = crr[j];
crr[j] = crr[j + 1];
crr[j + 1] = t;
}
for (int i = 0; i < crr.length; i++) {
System.out.print(crr[i]+"\t");
}
*/
System.out.println();
int ai=0,bi=0;
for (int i = 0; i < drr.length; i++) {
if(arr[ai] <= brr[bi]) {
drr[i] = arr[ai];
ai++;
}else {
drr[i] = brr[bi];
bi++;
}
if(ai == arr.length || bi == brr.length) {
for (int j = ai; j < arr.length; j++) {
drr[++i] = arr[j];
}
for (int k = bi; k < brr.length; k++) {
drr[++i] = arr[k];
}
break;
}
}
for (int i = 0; i < crr.length; i++) {
System.out.print(drr[i]+"\t");
}
// 按升序的方式合并成一个数组,合并后的数组不能有重复值(课后作业)
System.out.println();
for (int i = 0; i < crr.length - 1; i++) {
if (crr[i] == crr[i + 1]) {
crr[i] = -1;
}
if(crr[i] !=-1 )
{
System.out.print(crr[i] + "\t");
}
}
}
}
运行结果: