04Java数组

什么是数组

数组的声明和创建

package mothde;

public class demo04 {
    public static void main(String[] args) {
        int[] suma = new int[5];
        suma[0] = 1;
        suma[1] = 2;
        suma[2] = 3;
        suma[3] = 4;
        suma[4] = 5;

        System.out.println(suma[2]);
    }
}

三种初始化及内存分析

下标越界及小结

数组的四个基本特点

数组边界

数组的使用

package mothde;

public class arraydemo01 {
    public static void main(String[] args) {

        //没有下标
//        int[] nums = {1,2,3,4,5};
//        for (int num : nums) {
//            System.out.println(num);
//        }

        int[] array = {1,2,3,4,5};
        arryxs(array);
        System.out.println("==============");
        int[] a = fzarray(array);
        arryxs(a);



    }
    //遍历数组的方法
    public static void arryxs(int[] array){
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
    }

    //翻转数组
    public static int[] fzarray(int[] array){
        int[] result = new int[array.length];
        for (int i = 0; i < array.length; i++) {
            result[i] = array[array.length - i - 1];
        }
//        for (int i = 0,j = array.length - 1; i < array.length; i++,j--) {
//            result[j] = array[i];
//        }
        return result;
    }



}

多维数组

array类讲解

package mothde;

import java.util.Arrays;

public class ArrrayDemo02 {
    public static void main(String[] args) {
        int[] a = {5,1,15,1148,152,69,7,36};
        System.out.println(Arrays.toString(a));
        System.out.println("============");
        Arrays.sort(a);
        System.out.println(Arrays.toString(a));
        System.out.println("============");
        Arrays.fill(a,1);
        System.out.println(Arrays.toString(a));
    }
}

冒泡排序

package mothde;

import java.util.Arrays;

public class ArrayDemo03 {
    public static void main(String[] args) {
        int[] aaa = {551,88,61,1234,2,8,44,68,9,42};
        maopaopx(aaa);
        System.out.println(Arrays.toString(aaa));
    }
    public static void maopaopx(int[] array){
        int temp;

        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;
                }
            }
        }


    }
}

稀疏数组

…