package com.jiangdi.sparsearray;
public class SparseArray {
//创建二维数组11*11
//0:没有数组,1 表示黑子 2 表示白子
public static void main(String[] args) {
int chessArr1[][] = new int[11][11];
chessArr1[1][2] = 1;
chessArr1[2][3] = 2;
//输出原始二维数组
for (int[] ints : chessArr1) {
for (int anInt : ints) {
System.out.printf("%d\t",anInt);
}
System.out.println();
}
/*
* 将二维数组 转 稀疏数组
* 1、先遍历二维数组 得到非0数据的个数*/
int sum = 0;
for (int i = 0; i <chessArr1.length ; i++) {
for (int j = 0; j < chessArr1.length; j++) {
if (chessArr1[i][j]!=0){
sum++;
}
}
}
System.out.println("sum="+sum);
/*2.创建对应的稀疏数组*/
int sparseArr[][] = new int[sum+1][3];
//给稀疏数组赋值
sparseArr[0][0] =11;
sparseArr[0][1] =11;
sparseArr[0][2] =sum;
//遍历二维数组,将非0的值存放到 sparseArr中
int count = 0;
for (int i = 0; i <11 ; i++) {
for (int j = 0; j < 11; j++) {
if (chessArr1[i][j]!=0){
count++;
sparseArr[count][0] = i;
sparseArr[count][1] = j;
sparseArr[count][2] = chessArr1[i][j];
}
}
}
//输出稀疏数组
System.out.println();
System.out.println("得到稀疏数组为:");
for (int i = 0; i < sparseArr.length; i++) {
System.out.printf("%d\t%d\t%d\t\n",sparseArr[i][0],sparseArr[i][1],sparseArr[i][2]);
}
System.out.println();
/*将稀疏数组恢复成二位数组*/
int chessArr2[][] = new int[sparseArr[0][0]][sparseArr[0][1]];
//读取稀疏数组数据
for(int i=1; i<sparseArr.length;i++){
chessArr2[sparseArr[i][0]][sparseArr[i][1]]=sparseArr[i][2];
}
System.out.println();
for (int[] ints : chessArr2) {
for (int anInt : ints) {
System.out.printf("%d\t",anInt);
}
System.out.println();
}
}
}