稀疏数组
public class ArrayDemo08 {
public static void main(String[] args) {
int[][] array1 = new int[11][11];
array1[1][2] = 1;
array1[2][3] = 2;
for (int[] anInt:array1) {
for (int ints:anInt) {
System.out.print(ints+"\t");
}
System.out.println();
}
System.out.println("=================================================");
int sum = 0;
for (int i = 0; i < array1.length; i++) {
for (int j = 0; j < array1.length; j++) {
if (array1[i][j] != 0){
sum++;
}
}
}
System.out.println("有效值的个数为:"+ sum);
int[][] array2 = new int[sum+1][3];
array2[0][0] = 11;
array2[0][1] = 11;
array2[0][2] = sum;
int count = 0;
for (int i = 0; i < array1.length; i++) {
for (int j = 0; j < array1[i].length; j++) {
if (array1[i][j] != 0){
count++;
array2[count][0] = i;
array2[count][1] = j;
array2[count][2] = array1[i][j];
}
}
}
System.out.println("稀疏数组:");
for (int[] a2:array2) {
for (int b2:a2) {
System.out.print(b2 + "\t");
}
System.out.println();
}
System.out.println("输出稀疏数组的第二种方法=======================");
for (int i = 0; i < array2.length; i++) {
System.out.println(array2[i][0] + "\t"
+array2[i][1] + "\t"
+array2[i][2] + "\t");
}
System.out.println("====================================");
System.out.println("还原稀疏数组:");
int[][] array3 = new int[array2[0][0]][array2[0][1]];
for (int i = 1; i < array2.length; i++) {
array3[array2[i][0]][array2[i][1]] = array2[i][2];
}
System.out.println("输出还原的数组:");
for (int[] c1:array3) {
for (int c2:c1) {
System.out.print(c2 + "\t");
}
System.out.println();
}
}
}