public class SparseArray {
    public static void main(String[] args) {
        // 創(chuàng)建原始二維數(shù)組，11*11
        // 0表示沒有棋子，1表示黑子，2表示藍(lán)子
        int chessArr1[][] = new int[11][11];
        chessArr1[1][2] = 1;
        chessArr1[2][3] = 2;
        // 輸出原始的二維數(shù)組
        for (int[] row : chessArr1) {
            for (int data : row) {
                System.out.printf("%d\t", data);
            }
            System.out.println();
        }
        // 將二維數(shù)組 轉(zhuǎn)化為 稀疏數(shù)組
        // 1. 先遍歷二維數(shù)組，得到非0數(shù)據(jù)的個數(shù)
        int sum = 0;
        for (int i = 0; i < chessArr1.length; i++) {
            for (int j = 0; j < chessArr1.length ; j++) {
                if (chessArr1[i][j] != 0) {
                    sum++;
                }
            }
        }
        System.out.println("sum: " + sum);
        // 2. 創(chuàng)建對應(yīng)的稀疏數(shù)組
        int sparseArr[][] = new int[sum+1][3];
        // 給稀疏數(shù)組賦值
        sparseArr[0][0] = 11;
        sparseArr[0][1] = 11;
        sparseArr[0][2] = sum;
        // 3. 遍歷二維數(shù)組，得到非0數(shù)據(jù)存放到sparseArr
        int count = 0; // 用于記錄是第幾個非0數(shù)據(jù)
        for (int i = 0; i < chessArr1.length; i++) {
            for (int j = 0; j < chessArr1.length ; j++) {
                if (chessArr1[i][j] != 0) {
                    count++;
                    sparseArr[count][0] = i;
                    sparseArr[count][1] = j;
                    sparseArr[count][2] = chessArr1[i][j];
                }
            }
        }
        // 輸出稀疏數(shù)組
        System.out.println("稀疏數(shù)組：");
        for (int i = 0; i <  sparseArr.length; i++) {
            System.out.printf("%d\t%d\t%d\t\n", sparseArr[i][0], sparseArr[i][1], sparseArr[i][2]);
        }
        System.out.println();
        // 將稀疏數(shù)組 恢復(fù)成 原始的 二維數(shù)組
        // 1. 先讀取稀疏數(shù)組的第一行，根據(jù)第一行的數(shù)據(jù)，創(chuàng)建原始的二維數(shù)組
        int chessArr2[][] = new int[sparseArr[0][0]][sparseArr[0][1]];
        // 2. 讀取稀疏數(shù)組的后幾行數(shù)據(jù)，賦給原始的二維數(shù)組即可
        for (int i = 1; i < sparseArr.length; i++) {
            chessArr2[sparseArr[i][0]][sparseArr[i][1]] = sparseArr[i][2];
        }
        // 輸出恢復(fù)后的二維數(shù)組
        System.out.println("恢復(fù)后的二維數(shù)組：");
        for (int[] row : chessArr2) {
            for (int data : row) {
                System.out.printf("%d\t", data);
            }
            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	
sum: 2
稀疏數(shù)組：
11	11	2	
1	2	1	
2	3	2	
恢復(fù)后的二維數(shù)組：
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