数组添加+排序

import java.util.Scanner;

public class BubbleSort {
    public static void main(String[] args) {
        String[] strs = new String[]{"a","b","c"};

        //1.已知有个数组，要求插入一个元素，插入之后使数组是升序的状态，比如：【10,12,45,90】，
        //添加23后，数组为[10,12,23,45,90]
        int[] arr = {10,12,45,90};
        Scanner scanner = new Scanner(System.in);
        do {
            int[] arr2 = new int[arr.length + 1];
            //给arr2赋值
            for (int i = 0; i < arr.length; i++) {
                arr2[i] = arr[i];
            }
            //给数组的最后一个值赋值
            System.out.println("请输入要添加的值：");
            int addNum = scanner.nextInt();
            arr2[arr2.length - 1] = addNum;

            //改变地址引用
            arr = arr2;

            //排序
            int temp = 0;
            for(int i = 0;i < arr.length - 1;i++){
                for(int j = 0; j < arr.length - 1 - i; j++){
                    if(arr[j] > arr[j+1]){
                        temp = arr[j];
                        arr[j] = arr[j+1];
                        arr[j+1] = temp;
                    }
                }
            }
            //遍历输出arr数组中的值
            for (int i = 0; i < arr.length; i++) {
                System.out.print(arr[i] + "\t");
            }
            System.out.println("是否要继续添加：y/n");
            char key = scanner.next().charAt(0);
            if(key == 'n'){
                System.out.println("退出添加！");
                break;
            }
        }while(true);
    }
}