java学习笔记——数组的扩容和冒泡法排序

数组的扩容

import java.util.Scanner;

public class Shuzu_03 {

    public static void main(String[] args) {
        Scanner myScanner = new Scanner(System.in);
        int[] arr = {1,2,3};
        do {
            int[] arrNew = new int[arr.length+1];
            for(int i = 0;i<arr.length;i++)
            //添加元素
            {
                arrNew[i] = arr[i];
            }
            System.out.println("请输入你要添加的元素：");
            int add = myScanner.nextInt();
            arrNew[arrNew.length-1] = add;              //赋值
            arr = arrNew;                               //让arr指向arrnew
            //输出扩容后的效果
            System.out.println("扩容后的效果");
            for(int i = 0;i<arr.length;i++){
                    System.out.print(arr[i]+"\t");
            }
            //是否继续添加
            System.out.println("是否继续添加 y/n");
            char key = myScanner.next().charAt(0);
            if(key == 'n'){
                System.out.println("你已经退出扩容");
                break;
            }

        }while(true);
    }

}

数组的冒泡法排序

public class Shuzu_04 {
    public static void main(String[] args) {
        System.out.println("冒泡法排序");
        int[] arr = {24,26,69,31,80};
        int temp = 0;
        for (int j = 0;j<4;j++){
            if(arr[j]>arr[j+1]){
                temp =arr[j+1];
                arr[j] = arr[j+1];
                arr[j+1]= temp;
            }
        }
        for(int i= 0;i<arr.length;i++)
        {
            System.out.println(arr[i]+"\t");
        }
    }
}