稀疏数组实现

        int[][] array1 = new int[11][11];
        array1[1][2] = 1;
        array1[2][3] = 2;
        System.out.println("输出原始数组");
        for (int[] array : array1) {
            for (int a : array) {
                System.out.print(a + "\t");
            }
            System.out.println();
        }
        int sum = 0;
        //统计数组中不为0元素的个数
        for (int[] array : array1) {
            for (int a : array) {
                if (a != 0)
                    sum++;
            }
        }

        //定义稀疏数组
        int[][] array2 = new int[sum + 1][3];
        //定义稀疏数组第一行元素 (几行 几列 几个不为0的元素)
        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[] array : array2) {
            for (int a : array) {
                System.out.print(a + "\t");
            }
            System.out.println();
        }

        //还原稀疏数组
        int[][] array3 = new int[array2[0][0]][array2[0][1]];
        //从i = 1开始 因为不为0元素的信息从array2[1]开始
        for (int i = 1; i < array2.length; i++) {
            array3[array2[i][0]][array2[i][1]] = array2[i][2];
        }
        //打印还原后的数组
        System.out.println("=====================");
        for (int[] array : array3) {
            for (int a : array) {
                System.out.print(a + "\t");
            }
            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	
=====================
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