package com.array;

public class ArrayDemo06 {          //稀疏陣列
    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+"\t");
            }
            System.out.println();
        }

        //轉化為稀疏陣列儲存
        //獲取有效值的個數
        int sum=0;

        for (int[] ints : array1) {
            for (int anInt : ints) {
                if(anInt!=0)sum++;
            }
        }

        System.out.println(
 
"有效值的個數為："+sum);   //輸出2

        System.out.println("===============================");
        //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 = 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];

                }
            }
        }

        for (int[] ints : array2) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }

        System.out.println("===============================");
        //3.讀取稀疏陣列(還原)
        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];
        }

        System.out.println("輸出還原的陣列：");
        for (int[] ints : array3) {
            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    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