稀疏数组

稀疏数组

代码如下

package com.zxm.array;

public class ArrayDemo7 {
    public static void main(String[] args) {
        //创建一个11*11的二维数组  0：没有棋子  1：黑旗  2：白棋
        int[][] a = new int[11][11];
        a[3][5] = 2;
        a[8][6] = 1;
        System.out.println("输出原始的数组");
        for (int[] ints : a) {
            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 (a[i][j] != 0) {
                    sum++;
                }
            }
        }
        System.out.println("有效值的个数为：" + sum);
        //创建一个稀疏数组的数组
        int[][] a1 = new int[sum + 1][3];
        a1[0][0] = 11;
        a1[0][1] = 11;
        a1[0][2] = sum;
        //遍历二维数组，将非零的值，存放至稀疏数组中
        int count = 0;
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length; j++) {
                if (a[i][j] != 0) {
                    count++;
                    a1[count][0] = i;
                    a1[count][1] = j;
                    a1[count][2] = a[i][j];
                }

            }

        }

        //输出稀疏数组
        System.out.println("稀疏数组");
        for (int i = 0; i < a1.length; i++) {
            System.out.println(a1[i][0] + "\t" +
                    a1[i][1] + "\t" +
                    a1[i][2] + "\t");

        }
        System.out.println("==========================================");
        System.out.println("还原数组：");
        //1、读取稀疏数组中的值
        int[][] a2 = new int[a1[0][0]][a1[0][1]];
        //给其中的元素还原值
        for (int i = 1; i < a1.length; i++) {
            a2[a1[i][0]][a1[i][1]] = a1[i][2];
        }
        //3、打印还原数组
        System.out.println("还原后的数组为：");
        for (int[] ints : a2) {
            for (int anInt : ints) {
                System.out.print(anInt + "\t");
            }
            System.out.println();
        }
    }
}

运行结果如下

输出原始的数组
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	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	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	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	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
==========================================
有效值的个数为：2
稀疏数组
11	11	2	
3	5	2	
8	6	1	
==========================================
还原数组：
还原后的数组为：
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	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	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	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	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0