public class AscendOrder {
public static void main(String[] args) {
// [10, 12, 45, 90]
int[] arry = {10, 12, 45, 90};
int insertNum = 23;
int index = -1;
for (int i = 0; i < arry.length; i++){
if (insertNum <= arry[i]){
index = i;
break;
}
}
if (index == -1){//说明还没有找到条件
index = arry.length;
}
//扩容
int[] arrNum = new int[arry.length + 1];
for (int i = 0, j = 0; i < arry.length + 1; i++){
if (i != index){
arrNum[i] = arry[j];
j++;
} else {
arrNum[i] = insertNum;
}
}
arry = arrNum;
for (int i = 0; i < arry.length; i++) {
System.out.print(arry[i] + "\t");
}
// System.out.println("index的值:" + index);
}
}
一维数组插入
最新推荐文章于 2024-02-06 22:41:56 发布