向有序数组插入，并保持有序

Soulcodefarmer

于 2022-09-22 16:32:55 发布

阅读量90

点赞数

文章标签： java 算法数据结构

本文链接：https://blog.csdn.net/Soulcodefarmer/article/details/126994773

版权

import java.util.Scanner;

public class jichu {
    public static void main(String[] args) {
        Scanner ms = new Scanner(System.in);
        int a = ms.nextInt();
        int[] arr = {10 ,12,45,90};
        int[] newarr = new int[arr.length+1];
        boolean e = true;
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] < a && e) {
                newarr[i] = arr[i];
            } else if (e) {
                newarr[i] = a;
                newarr[i + 1] = arr[i];
                e = false;
            } else {
                newarr[i + 1] = arr[i];
            }
        }
        if (e) {
            newarr[arr.length ] = a;
        }
        arr = newarr;
        for (int j = 0; j < arr.length; j++) {
            System.out.print(arr[j] +" ");
        }