稀疏数组

public class demo04 {
    public static void main(String[] args) {
        //定义原始数组
        int[][] array1 = new int[11][11];
        array1[1][2] = 1;
        array1[2][3] = 1;
        //输出原始数组
        System.out.println("====原始数组====");
        for (int i = 0; i < array1.length; i++) {
            for (int j = 0; j < array1[i].length; j++) {
                int a = array1[i][j];
                System.out.print(a);
            }
            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 he = 0;
        //遍历二维数组，将有效值录入稀疏数组中
        for (int i = 0; i < array1.length; i++) {
            for (int j = 0; j < array1[i].length; j++) {
                if (array1[i][j] != 0) {
                    he++;
                    array2[he][0] = i;
                    array2[he][1] = j;
                    array2[he][2] = array1[i][j];
                }
            }
        }
        System.out.println("====稀疏数组====");
        for (int i = 0; i < he; i++) {
            System.out.println(array2[i][0] + "\t" + array2[i][1] + "\t" + array2[i][2] + "\t");
        }
        ;
        //数组还原
        System.out.println("====数组还原====");
        //读取稀疏数组
        int[][] array3 = new int[array2[0][0]][array2[0][1]];
        //录入有效值
        for (int i = 1; i < array2.length; i++) {
            array3[array2[i][0]][array2[i][1]]=array2[i][2];
        }
        for (int i = 0; i < array3.length; i++) {
            for (int j = 0; j < array3[i].length; j++) {
                int a = array1[i][j];
                System.out.print(a);
            }
            System.out.println();
        }
    }

}