稀疏数组(压缩与解压)
public class array {
public static void main(String[] args) {
int[][] b = new int[11][11];
b[1][2] = 1;
b[2][3] = 2;
System.out.println("输出原始的数组");
for (int[] ints : b) {
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();
}
System.out.println("稀疏数组:");
//转化为稀疏数组保存
//获取有效值的个数
int sum = 0;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
if (b[i][j] != 0){
sum++;
}
}
}
//2.创建一个稀疏数组
int[][] c = new int[sum+1][3];
c[0][0] = 11;
c[0][1] = 11;
c[0][2] = sum;
//遍历二维数组
int count = 0;
for (int i = 0; i < b.length; i++) {
for (int j = 0; j < b[i].length; j++) {
if (b[i][j] != 0) {
count++;
c[count][0] = i;
c[count][1] = j;
c[count][2] = b[i][j];
}
}
}
//打印稀疏数组
for (int i = 0; i < c.length; i++) {
for (int j = 0; j < c[i].length; j++) {
System.out.print(c[i][j]+"\t");
}
System.out.println();
}
System.out.println("还原稀疏数组:");
//还原稀疏数组
int[][] d = new int[c[0][0]][c[0][1]];
for (int i = 1; i < c.length; i++) {
d[c[i][0]][c[i][1]] = c[i][2];
}
for (int[] ints : d) {
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();
}
}
}