数组、冒泡排序

一维数组

public static void main(String[] args) {
        int[] nums; //1.声明了一个数组
        nums = new int[10]; //2.创建一个数组，分配了空间

        //3.给数组元素赋值
        for (int i = 0; i < nums.length; i++) {
            nums[i] = i+1;
        }
        int sum = 0;
        //计算元素的和
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
        }
        for (int num : nums) {
            System.out.println(num);
        }
        System.out.println(sum);
        int[] arr = new int[]{1,2,3,45,0};
    }

初始化类型

  public static void main(String[] args) {
        //静态初始化 创建+ 赋值
        int[] a = {1,2,3,4,5,6,7,8};

        //动态初始化
        int[] b = new int[10];
        b[0] = 10;

    }

擂台法，找到数组最大数

 int max = arrays[0];
        for (int i = 1; i < arrays.length; i++) {
            if (max < arrays[i]){
                max = arrays[i];
            }
        }
        System.out.println("max = "+ max);
    }

数组的反转

  public static int[] reverse(int[] array){
        int[] result = new int[array.length];
        for (int i = 0; i < result.length; i++) {
            //赋值
            result[i] = array[result.length-i-1];
        }
        return result;
    }

二维数组

遍历当中元素

 public static void main(String[] args) {
        int[][] array = {{1,2},{2,5},{3,7}};
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                System.out.println(array[i][j]);
            }
        }
    }

Arrays工具类的使用

    public static void main(String[] args) {
        int[] a = {232,34,54,45344,2,54575,7766,86};
        System.out.println(Arrays.toString(a));
        //排序:升序
        Arrays.sort(a);
        System.out.println(Arrays.toString(a));
        //填充
        Arrays.fill(a,0);
        System.out.println(Arrays.toString(a));
    }

冒泡排序

   public static void main(String[] args) {
            int[] array = {322,43,4354,5,46,56,75};
        int[] ints = bubbleSort(array);
        for (int anInt : ints) {
            System.out.print(anInt+ " ");
        }
    }
    public static int[] bubbleSort(int[] array){
        int temp = 0;
        for (int i = 0; i < array.length - 1;i++) {
            for (int j = 0; j < array.length -1 - i; j++) {
                if (array[j] > array[j+1]){
                    temp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = temp; 
                }
            }
        }
        return array;
    }