java数组添加并进行升序排列

最新推荐文章于 2023-07-17 20:10:16 发布

天下一场梦

最新推荐文章于 2023-07-17 20:10:16 发布

阅读量369

点赞数

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

本文链接：https://blog.csdn.net/qq_64311264/article/details/127464987

版权

import java.util.Scanner;
public class 数组添加升序 {
    public static void main(String[] args) {


            int arr[] = {10, 12, 43, 55, 32};

                for (int mj = 0; ; mj++) {
                    System.out.println("是否继续添加？");
                    Scanner is_scanner = new Scanner(System.in);
                    String huida = is_scanner.next();int brr[] = new int[arr.length + 1];
            if (huida.equals("是")) {
                System.out.print("请输入您要添加的数：");
                int m = is_scanner.nextInt();
                int i = 0;
                int j = 0;
                for (int mb = 0; mb < arr.length; mb++) {
                    brr[mb] = arr[mb];
                }
                brr[brr.length - 1] = m;
                for (j = 0; j < (brr.length) * (brr.length - 1) / 2; j++) {
                    for (i = 0; i < brr.length - 1; i++) {
                        int temp;
                        if (brr[i] > brr[i + 1]) {
                            temp = brr[i];
                            brr[i] = brr[i + 1];
                            brr[i + 1] = temp;
                        }

                    }
                }arr=brr;
                for (int mlgb = 0; mlgb < brr.length; mlgb++) {
                    System.out.print(brr[mlgb] + " ");
                }
            } else if (huida.equals("不是")) {
                break;
            } else {
                System.out.println("请重新回答");
            }
        }
    }
}