package EXER2;
import com.sun.org.apache.xpath.internal.operations.Neg;
public class HomeWorkE04 {
public static void main(String[] args) {
int arr[] = new int[]{10,12,45,90};
int insertNum = 23;
int index = -1;
for(int i = 0;i < arr.length;i++){
if(insertNum < arr[i]){
index = i;
break;
}
}
int arrNew[] = new int[arr.length + 1];
if(index == -1){
arrNew[arr.length + 1] = insertNum;
}
for(int i = 0,j = 0;i < arrNew.length;i++ ){
if(index != i){
arrNew[i] = arr[j];
j++;
}else {
arrNew[index] = insertNum;
}
}
arr = arrNew;
for (int i = 0;i < arr.length;i++){
System.out.print(arr[i] + " ");
}
System.out.println();
}
}
已知有个升序的数组,要求插入一个元素,该数组顺序依然是升序,比如:{10,12,45,90},添加23后,数组为:{10,12,23,45,90}
最新推荐文章于 2024-06-07 08:25:31 发布