package com.Zhang.array;
import java.util.Arrays;
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[] ints:array1){
for (int x:ints){
System.out.print(x+"\t");
}
System.out.println();
}
System.out.println("======================");
//转换为稀疏数组
//记录array1中有几个非零数字
int sum=0;
for (int i = 0; i < array1.length; i++) {
for (int j = 0; j < array1[i].length; j++) {
if(array1[i][j]!=0){
sum++;
}
}
}
//稀疏数组只有三列,从左到右依次是行,列,值,并且第一行为原数组的行数、列数和非零数个数
int [][]array2=new int [sum+1][3];
array2[0][0]= array1.length;
array2[0][1]=array1.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];
}
}
}
//打印稀疏数组
for(int[] ints:array2){
for (int x:ints){
System.out.print(x+"\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];
}
for(int[] ints:array3){
for (int x:ints){
System.out.print(x+"\t");
}
System.out.println();
}
}
}
以下为运行结果