数组

数组

数组的定义和声明

  int[] num = new int[10];//数组的定义

数组的初始化和内存

数组下标越界

超过数组最大容量

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 

数组的使用

public class ArrayDemo02 {
    public static void main(String[] args) {
        //静态初始化
        int[] arrays = {1,2,3,4,5};//定义数组

        //打印数组元素
        for (int i = 0; i < arrays.length ; i++) {
            System.out.println(arrays[i]);
        }

        System.out.println("===============================");
        //计算总和
        int sum = 0;
        for (int i = 0; i < arrays.length; i++) {
            sum += arrays[i];

        }
        System.out.println(sum);

        System.out.println("===============================");

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

二维数组

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

        /*
        int[] arrays = {1};
        int[][] arrays = {{1}};
         */
        //定义二维数组
        int[][] arrays = {{1,2},{2,3},{3,4},{4,5}};

        printArray(arrays);

    }

    //打印数组元素
    public static void printArray(int[][] arrays){
        for (int i = 0; i <arrays.length ; i++) {
            for (int j = 0; j <arrays[i].length ; j++) {

                System.out.println(arrays[i][j]);

            }
        }
    }
}

Arrays工具类

自行查看方法

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

        int[] a = {1,5,8,1,4,5,134,55,51};
/*
        System.out.println(a);//[I@1b6d3586

        System.out.println(Arrays.toString(a));//[1, 5, 8, 1, 4, 5, 134, 55, 51]

        printArrays(a);//[1, 5, 8, 1, 4, 5, 134, 55, 51]*/

//      排序
        Arrays.sort(a);
        System.out.println(Arrays.toString(a));

        //填充
        Arrays.fill(a,0,3,2);
        System.out.println(Arrays.toString(a));

    }

    //自定义打印，重复造轮子
    public static void printArrays(int[] arrays){

        for (int i = 0; i <arrays.length ; i++) {
            if (i==0){
                System.out.print("[");
            }
            if (i==arrays.length-1){
                System.out.print(arrays[i]+"]");
            }else {
                System.out.print(arrays[i]+", ");
            }
        }
    }
}

冒泡排序

package com.zhou.array;

import java.util.Arrays;

//冒泡排序
public class ArrayDemo06 {
    public static void main(String[] args) {

        int[] s = {1,5,78,6,3,1,4,5,1,12315,15,16};
        int[] a = sort(s);
        System.out.println(Arrays.toString(a));
    }

    public static int[] sort(int[] arrays){

        int temp = 0;
        boolean flag = false;
        for (int i = 0; i <arrays.length-1 ; i++) {//外层循环，判断我们需要循环几次

            for (int j = 0; j <arrays.length-1-i ; j++) {//内层循环，每次都会减少一次
                if (arrays[j+1] > arrays[j]){
                    temp = arrays[j] ;
                    arrays[j] = arrays[j+1];
                    arrays[j+1] = temp;
                    flag = true;
                }
            }
            if (flag == false){
                break;
            }
        }
        return arrays;
    }
}

稀疏数组

package com.zhou.array;

import java.util.Arrays;

//稀疏数组
/*
11 11 2
1  2  1
2  3  2
 */
public class ArrayDemo07 {
    public static void main(String[] args) {

        int[][] array1 = new int[11][11];
        array1[1][2] = 1;
        array1[2][3] = 2;

        System.out.println("原始数组：");

        for (int[] ints : array1) {
            for (int anInt : ints){
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }

        /*
        0	0	0	0
        0	0	1	0
        0	0	0	2
        0	0	0	0
         */

        System.out.println("=====================");

        //计算有效值个数
       int sum = 0;
        for (int i = 0; i <11 ; i++) {
            for (int j = 0; j <11 ; j++) {
               if (array1[i][j] != 0){
                   sum++;
               }
            }
        }
        System.out.println("有效个数:"+sum);

        //稀疏数组
        int[][] array2 = new int[sum+1][3];

        array2[0][0] = 11;
        array2[0][1] = 11;
        array2[0][2] = sum;
        
        //遍历二维数组
        int count =0;
        for (int i = 0; i < array1.length; i++) {
            for (int j = 0; j < array1[i].length; j++) {
                if (array1[i][j] !=0){
                    count++;
                    array2[count][0] = i;
                    array2[count][1] = j;
                    array2[count][2] = array1[i][j];
                }
            }
        }
        //输出稀疏数组
        System.out.println("稀疏数组");

        for (int i = 0; i < array2.length; i++) {
            System.out.println(array2[i][0]+"\t"
                                +array2[i][1]+"\t"
                                +array2[i][2]+"\t"
            );
        }

        System.out.println("====================");
        System.out.println("还原");

        //1.读取稀疏数组
        int[][] array3 = new int[array2[0][0]][array2[0][1]];


        //2.给其中的元素还原它的值
        for (int i = 1; i < array2.length; i++) {
            array3[array2[i][0]][array2[i][1]] = array2[i][2];

        }

        //打印
        System.out.println("输出还原的数组");

        for (int[] ints : array3) {
            for (int anInt : ints){
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }



    }
}