package com.sparse;
public class SparseArray {
public static void main(String[] args) {
//先创建一个原始的二维数组 0表示没有棋子 1表示黑 2表示蓝
int chessArr1[][] = new int[11][11];
chessArr1[1][2]=1;
chessArr1[2][3]=2;
chessArr1[3][3]=2;
chessArr1[4][3]=2;
chessArr1[5][3]=2;
chessArr1[6][3]=2;
//输出一下二维数组
System.out.println("原始的二维数组~~~~~~~~~~~~~~~~~~~~~~");
for (int[] row : chessArr1) {
for (int data : row) {
System.out.printf("%d\t",data);
}
System.out.println();
}
System.out.println("转换为稀疏数组");
//先得到有多少个棋子
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("有多少个棋子:"+sum);
//创建稀疏数组
int sparseArr [][] = new int[sum+1][3];
//赋值
sparseArr[0][0]=11;
sparseArr[0][1]=11;
sparseArr[0][2]=sum;
int count = 0;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
if(chessArr1[i][j]!=0){
count++;
sparseArr [count] [0]=i;
sparseArr [count] [1]=j;
sparseArr [count] [2]=chessArr1[i][j];
}
}
}
//输出稀疏数组
System.out.println("得到的稀疏数组~~~~~~~~~~~~~~~~~~~~~~");
for (int[] row : sparseArr) {
for (int data : row) {
System.out.printf("%d\t",data);
}
System.out.println();
}
System.out.println("恢复二维数组~~~~~~~~~~~~~~~~~~~~~~");
int[][] chessArr2 = new int[sparseArr[0][0]][sparseArr[0][1]];
for (int i = 1; i <= sparseArr[0][2]; i++) {
chessArr2[sparseArr[i][0]][sparseArr[i][1]]=sparseArr[i][2];
}
//打印二维数组
for (int[] row : chessArr2) {
for (int data : row) {
System.out.printf("%d\t",data);
}
System.out.println();
}
}
}
java二维数组转稀疏数组
最新推荐文章于 2022-10-27 17:27:27 发布