//1.創(chuàng)建一個二維數(shù)組
int chessArr1[][]=new int[11][11];
//2.給二維數(shù)組賦值
chessArr1[1][2]=1;
chessArr1[2][3]=2;
//3.雙重for循環(huán)輸出二維數(shù)組
System.out.println("原始的二維數(shù)組：");
for (int[] row : chessArr1) {
    for (int data : row) {
        System.out.printf("%d\t",data);
    }
    //每輸出完一個一重數(shù)組換一行
    System.out.println();
}

//將二維數(shù)組轉(zhuǎn)稀疏數(shù)組
//1.先遍歷二維數(shù)組，得到非0數(shù)據(jù)的個數(shù)，知道數(shù)據(jù)個數(shù)，就可以創(chuàng)建稀疏數(shù)組（知道了稀疏數(shù)組的行）
int sum=0;
for (int i = 0; i < 11; i++) {
    for (int j = 0; j < 11; j++) {
        if (chessArr1[i][j]!=0){
            sum++;
        }
    }
}
System.out.println("有效值的個數(shù)為："+sum);
//2.創(chuàng)立對應(yīng)的稀疏數(shù)組
int sparseArr[][]=new int[sum+1][3];
//3.給稀疏數(shù)組賦值
sparseArr[0][0]=11;
sparseArr[0][1]=11;
sparseArr[0][2]=sum;
//4.遍歷二維數(shù)組，給稀疏數(shù)組
int count=0;//用于記錄是第幾行
for (int i = 0; i < 11; i++) {
    for (int j = 0; j < 11; j++) {
        if (chessArr1[i][j]!=0){
            sparseArr[count+1][0]=i;
            sparseArr[count+1][1]=j;
            sparseArr[count+1][2]=chessArr1[i][j];
            count++;
        }
    }
}
//5.輸出稀疏數(shù)組
//以下是兩種遍歷方式：
/*for (int[] ints : sparseArr) {
    for (int anInt : ints) {
        System.out.printf("%d\t",anInt);
    }
    //把一個數(shù)組遍歷完之后換一行
    System.out.println();
}*/
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]);
}

//把稀疏數(shù)組還原為二維數(shù)組
//1.創(chuàng)建二維數(shù)組
int chessArr2[][]=new int[sparseArr[0][0]][sparseArr[0][1]];
//2.給二維數(shù)組賦值
for (int i = 1; i < sparseArr.length; i++) {
    chessArr2[sparseArr[i][0]][sparseArr[i][1]]=sparseArr[i][2];
}
//3.輸出二維數(shù)組
for (int[] row : chessArr2) {
    for (int data : row) {
        System.out.printf("%d\t",data);
    }
    System.out.println();
}