5.数组详解

01、什么是数组

02、数组的声明和创建

package com.wzt.www.array;

/**
 * @author WZT
 * @create 2021-03-26 13:50
 */
public class ArrayDemo01 {
    public static void main(String[] args) {
        int[] nums;//1.声明一个数组

        nums = new int[10];//创建一个数组

        //3.给数组元素中赋值
        nums[0] = 1;
        nums[1] = 2;
        nums[2] = 3;
        nums[3] = 4;
        nums[4] = 5;
        nums[5] = 6;
        nums[6] = 7;
        nums[7] = 8;
        nums[8] = 9;
        nums[9] = 10;

        System.out.println(nums[0]);

        //计算所有元素的和
        int sum = 0;

        for (int i = 0; i < nums.length; i++) {

            sum += nums[i];

        }
        System.out.println(sum);
    }
}

输出

1
55

03、三种初始化及内存分析

初始化

package com.wzt.www.array;

/**
 * @author WZT
 * @create 2021-03-26 17:25
 */
public class ArrayDemo02 {
    public static void main(String[] args) {
        //静态初始化：创建+赋值
        int[] a = {1,2,3,4,5,6,7,8,9,10};
        System.out.println(a[2]);
        //动态初始化：包含默认值
        int[] b = new int[10];
        b[0] = 10;
        System.out.println(b[0]);
        System.out.println(b[3]);
    }
}

输出

3
10
0

04、下标越界及小结

05、数组的使用

package com.wzt.www.array;

import java.util.Arrays;

/**
 * @author WZT
 * @create 2021-03-26 18:06
 */
public class ArrayDemo04 {
    public static void main(String[] args) {
        int[] arrays = {1, 2, 3, 4, 5};
//        for (int array : arrays) {
//            System.out.println(array);
//        }

        printArray(arrays);
        System.out.println("=========================");
        printArray(reserve(arrays));
    }

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

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

        }
        return result;
    }
}

输出

1
2
3
4
5
=========================
5
4
3
2
1

Process finished with exit code 0

常规操作

package com.wzt.www.array;

/**
 * @author WZT
 * @create 2021-03-26 18:06
 */
public class ArrayDemo03 {
    public static void main(String[] args) {
        int[] array = {1,2,3,4,5};

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

        System.out.println("===================");
        //计算所有元素的和
           int sum = 0;
            for (int i = 0; i < array.length; i++) {
                sum += array[i];
                
            }
        System.out.println("和为："+sum);

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

            int max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max<array[i]){
                max = array[i];
            }

        }
        System.out.println("最大值为："+max);
        }
    }

输出

1
2
3
4
5
===================
和为：15
======================
最大值为：5

Process finished with exit code 0

06、二维数组

package com.wzt.www.array;

/**
 * @author WZT
 * @create 2021-03-27 13:57
 */
public class ArrayDemo05 {
    public static void main(String[] args) {
        int[][] array = {{1,2},{3,4},{5,6},{7,8},{8,9}};
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
        System.out.println("====================");
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i][0]);
            System.out.println(array[i][1]);
        }
        System.out.println("====================");
        printArray(array[0]);

        System.out.println("====================");
        System.out.println(array[0][1]);
    }
    public static void printArray(int[] arrays){
        for (int i = 0; i < arrays.length; i++) {
            System.out.println(arrays[i]);

        }
    }
}

输出

[I@1b6d3586
[I@4554617c
[I@74a14482
[I@1540e19d
[I@677327b6
====================
1
2
3
4
5
6
7
8
8
9
====================
1
2
====================
2

Process finished with exit code 0

• 原理图
  

07、Arrays类详解

package com.wzt.www.array;

import java.util.Arrays;//util是工具包，Array数组工具包

/**
 * @author WZT
 * @create 2021-03-27 14:32
 */
public class ArrayDemo06 {
    public static void main(String[] args) {
        int[] a = {1,3,544,656,423,777,234,1124};
        System.out.println(Arrays.toString(a));//toString是打印数组
        Arrays.sort(a);
        System.out.println(Arrays.toString(a));//sort是将数组升序排序
        Arrays.fill(a,2,4,7);
        System.out.println(Arrays.toString(a));//将指定的字节值分配给指定字节数组的指定范围的每个元素
    }
}

输出

[1, 3, 544, 656, 423, 777, 234, 1124]
[1, 3, 234, 423, 544, 656, 777, 1124]
[1, 3, 7, 7, 544, 656, 777, 1124]

Process finished with exit code 0

08、冒泡排序

package com.wzt.www.array;

import java.util.Arrays;

/**
 * @author WZT
 * @create 2021-03-27 15:32
 */
public class ArrayDemo07 {
    public static void main(String[] args) {
        int[] a = {12,453,45,46,567,234,78,23,12,34,75,8,434};
        sort(a);
        System.out.println(Arrays.toString(a));
    }
    public static int[] sort(int array[]){
        int tem =  0;//临时变量
        //外层循环判断我们这个要走多少次
        for (int i = 0; i < array.length-1; i++) {
            boolean flag = false;//通过flag标识位减少没有意义的比较
            //内层循环，比较判断两个数，如果第一个数比第二个数大，则交换位置
            for (int j = 0; j < array.length-1-i; j++) {
                if (array[j] > array[j+1]){
                    tem = array[j];
                    array[j] = array[j+1];
                    array[j+1] = tem;
                    flag = true;
                }
            }
            if (flag = false){
                break;
            }
        }
        return array;
    }
}

输出

[8, 12, 12, 23, 34, 45, 46, 75, 78, 234, 434, 453, 567]

Process finished with exit code 0

• 上面的排序有一个优化，使用的是引入flag=false就跳出排序，在数组很长时就会缩短排序时间。

09、稀疏数组

package com.wzt.www.array;

import javax.xml.transform.Source;

/**
 * @author WZT
 * @create 2021-03-27 16:18
 */
public class ArrayDemo08 {
    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();
        }
        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("======================");
        //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+" ");
            }
            System.out.println();
        }

    }
}

输出

输出原始数组：
0	0	0	0	0	0	0	0	0	0	0	
0	0	1	0	0	0	0	0	0	0	0	
0	0	0	2	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
===========================
有效值的个数：2
稀疏数组：
11	11	2	
1	2	1	
2	3	2	
======================
原始数组：
0 0 0 0 0 0 0 0 0 0 0 
0 0 1 0 0 0 0 0 0 0 0 
0 0 0 2 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 

Process finished with exit code 0