稀疏数组
在二维数组的学习中,了解到有时候二维数组存有大量无效的数据,为零或者为空,占据了大量的空间,为了能更方便更少空间的描述此数组,即提出了稀疏数组的概念,也可以称为数组的压缩.
稀疏数组的存储
稀疏数组的第一行,分别记录原始二维数组的总行数总列数和具体有效的二维数组个数.接下来每一行分别存储着有效二维数组数所在行所在列和具体指.
package feifan.day1;
public class xishu { public static void main(String[] args) {
//定义一个数组
int [][] a = new int[15][15];
//给部分数组赋值
a[0][1] = 2;
a[1][1] = 3;
a[2][5] = 4;
int sum = 0;//记录有效数字个数
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if(a[i][j]!=0){
sum++;
}
}
}
//稀疏数组
int [][] x = new int[sum+1][3];
x[0][0] = 15;
x[0][1] = 15;
x[0][2] = sum;
//把非0的元素存入到稀疏数组
int index = 1;
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if(a[i][j]!=0){
x[index][0] = i;
x[index][1] = j;
x[index][2] = a[i][j];
index++;
}
}
}
//输出稀疏数组
for (int i = 0; i < x.length; i++) {
for (int j = 0; j < x[i].length; j++) {
System.out.print(x[i][j]+"\t");
}
System.out.println();
}
//把稀疏数组转为 二维数组
int [][] chessArr2 = new int[x[0][0]] [x[0][1]];
for (int i=1;i<x.length;i++){
chessArr2[x[i][0]][x[i][1]]=x[i][2];
}
for (int i = 0; i < chessArr2.length; i++) {
for (int j = 0; j < chessArr2[i].length; j++) {
System.out.print(chessArr2[i][j]+"\t");
}
System.out.println();
}
}
}