以11*11的五子棋棋盘为例,可以将棋盘视为一个二维数组保存,将黑棋看做1,白棋看做2
稀疏矩阵规则和转换思路如下
代码实现如下
package Data_structures;
import jdk.jshell.spi.SPIResolutionException;
public class Sparse_array {
public static void main(String[] args) {
//建立一个11*11的二维数组
int[][] chessArray = new int[11][11];
chessArray[1][2] = 1;
chessArray[2][3] = 2;
chessArray[3][5] = 2;
System.out.println("原来的二维数组如下:");
for (int[] row : chessArray) {
for (int i : row) {
System.out.printf("%d\t",i);
}
System.out.println();
}
//找出二维数组中不为0的树的个数
int sum = 0;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
if (chessArray[i][j] != 0) {
sum++;
}
}
}
//建立稀疏数组,稀疏数组为【不为零元素个数=1】【3】
int[][] spraceArray = new int[sum + 1][3];
//为稀疏数组各元素赋值
spraceArray[0][0] = 11;
spraceArray[0][1] = 11;
spraceArray[0][2] = sum;
//遍历二维数组,找不为0的数
int count = 0;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
if (chessArray[i][j] != 0) {
count++;
spraceArray[count][0] = i;
spraceArray[count][1] = j;
spraceArray[count][2] = chessArray[i][j];
}
}
}
//打印出稀疏数组
System.out.println("稀疏数组为:");
for (int i = 0; i < spraceArray.length; i++) {
System.out.printf("%d\t%d\t%d\t\n",
spraceArray[i][0],spraceArray[i][1],spraceArray[i][2]);
}
//将稀疏数组转换为二维数组
//首先读第一行
System.out.println("将上面稀疏数组转换后的二维数组为:");
int[][] chessArray1 = new int[spraceArray[0][0]][spraceArray[0][1]];
for(int i = 1; i < spraceArray.length; i++) {
chessArray1[spraceArray[i][0]][spraceArray[i][1]]=spraceArray[i][2];
}
for (int[] row : chessArray1) {
for (int data : row) {
System.out.printf("%d\t",data);
}
System.out.println();
}
}
}