一、稀疏数组
package method;
public class ArrayDemo01 {
public static void main(String[] args) {
//1.创建一个普通二维数组 11*11 0:没有棋子 1:黑棋 2:白棋
int[][] array1 = new int[11][11];
array1[1][2] = 1;
array1[2][3] = 2;
//输出这个普通的数组
System.out.println("输出原始的数组");
for (int[] ints : array1){
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();//换行
}
//转换为稀疏数组保存
//从原始的二维数组中获取有效值的个数
int sum = 0;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
if (array1[i][j] != 0){
sum++;
}
}
}
System.out.println("有效值的个数:"+sum);
//2.创建一个稀疏数组
int[][] array2 = new int[sum+1][3];
/*稀疏数组的格式 二维数组的格式
行 列 值
[0] 5 7 3 0 1 2 3 4 5 6
[1] 0 1 22 0 {0 ,22,0 ,0 ,0 ,0 ,0 }
[2] 1 3 34 1 {0 ,0 ,0 ,34,56,0 ,0 }
[3] 1 4 56 2 {0 ,0 ,0 ,0 ,0 ,0 ,0 }
[4] 3 6 2 3 {0 ,0 ,0 ,0 ,0 ,0 ,2 }
[5] 4 1 11 4 {0 ,11,0 ,0 ,0 ,0 ,0 }
*/
//稀疏数组的表头 表示11行11列 sum个值
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++; //count从1开始,第0行是表头
array2[count][0] = i; //输入行
array2[count][1] = j; //输入列
array2[count][2] = array1[i][j]; //输入值
}
}
}
//输出稀疏数组
System.out.println("稀疏数组");
for (int i = 0; i < array2.length; i++) {
System.out.println(array2[i][0]+"\t"
+array2[i][0]+"\t"
+array2[i][0]+"\t");
}
System.out.println("==========================");
System.out.println("还原");
//1.读取稀疏数组,并创建一个普通二维数组
int[][] array3 = new int[array2[0][0]][array2[0][1]]; //int[行数 ,列数]
//2.给其中的元素还原他的值
for (int i = 1; i < array2.length; i++) { //从第一行开始遍历,第0行是表头
array3[array2[i][0]][array2[i][1]] = array2[i][2];
}
//3.打印
System.out.println("输出还原的数组");
for (int[] ints : array1){
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();//换行
}
}
}