稀疏函数实现
package array;
public class sparseArray {
public static void main(String[] args) {
sparse();
}
public static void sparse() {
int length = 11;
int[][] array1 = new int[length][length];
array1[2][3] = 1;
array1[3][4] = 2;
System.out.println("原始数组");
prints(array1);
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 += 1;
}
}
}
int[][] array2 = new int[sum + 1][3];
array2[0][0] = length;
array2[0][1] = length;
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];
}
}
}
prints(array2);
System.out.println("还原稀疏数组");
int[][] array3 = new int[length][length];
for (int i = 1; i < array2.length; i++) {
array3[array2[i][0]][array2[i][1]] = array2[i][2];
}
prints(array3);
}
public static void prints(int[][] array) {
for (int[] ints : array) {
for (int anInt : ints) {
System.out.print(anInt + "\t");
}
System.out.println();
}
}
}