已知有个升序的数组，要求插入一个元素，该数组的元素仍然按升序排列，比如：[10,12,45,90]，添加23后，数组为[10,12,23,45,90]

int[] arr1 = {10,12,45,90};

int[] arr2 = new int[5];

int num = 23;

int index = -1;

for (int i = 0; i < arr1.length-1; i++) {

if (num <= arr1[i]){ //找到插入位置

index = i;

break;

}

}

if (index == -1){

index = arr1.length;

}

System.out.println(index);

for (int i = 0,j=0; i < arr2.length; i++) {

if (i != index){

arr2[i] = arr1[j];

j++;

}else {

arr2[i] = num;

}

}

System.out.println(Arrays.toString(arr1));

System.out.println(Arrays.toString(arr2));