Day08_java数组 稀疏数组

稀疏数组

• 需求：编写五子棋游戏中，有存盘退出和续上盘的功能。

• 分析问题：因为该二维数组的很多值默认值0，因此记录了很多没有意义的数据。
• 解决：稀疏数组

package com.lemon.array;

public class ArrayDemo08 {
    public static void main(String[] args) {
        //1.创建一个二维数组11*11   0：没有棋子      1：黑棋    2：白棋
        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+"	");
            }
            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);

        //2.创建一个稀疏数组的数组
        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 = 1; 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];
                }
            }

        }

        for (int i = 0; i < array2.length; i++) {
            System.out.println(array2[i][0]+"	"
                    +array2[i][1]+"	"
                    +array2[i][2]+"	");
        }
        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];
        }
        //3、打印
        System.out.println("输出还原的数组");
        for(int[] ints:array1){
            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