用于压缩数组,记录行列值
把具有不同值的元素和行列及值记录在一个小规模数组中
package com.zhang.array; public class ArrayDemo08 { public static void main(String[] args) { //创建一个二维数组 11*11 ,0没有棋子,1黑,2白 int[][] array1 = new int[11][11]; array1[1][2] = 1; array1[2][3] = 1; System.out.println("输出原始的数组"); for(int[] ints:array1){ 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(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[] ints : array2) { for (int anInt: ints) { System.out.print(anInt + "\t"); } System.out.println(); } 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[] ints : array3) { for (int anInt: ints) { System.out.print(anInt + "\t"); } System.out.println(); } } }