稀疏数组
例题
给定一个数组 0 0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0
0 0 0 2 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
将其变换为稀疏数组 11 11 2
1 2 1
2 3 2
再将稀疏数组还原为原数组。
代码
package com.yicurtain.array;
import java.util.Arrays;
public class xishuarray {
public static void main(String[] args) {
int[][] array1=new int[11][11];
array1[1][2]=1;
array1[2][3]=2;
//遍历定义的整个数组
for (int i = 0; i < array1.length; i++) {
for (int j = 0; j <array1.length ; j++) {
System.out.print(array1[i][j]+"\t");
}
System.out.println();
}
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++;
}
}
}
System.out.println("该数组中不为0的个数为:"+sum);
int count=0;
int[][] array2=new int[sum+1][3];
array2[0][0]=11;
array2[0][1]=11;
array2[0][2]=sum;//这里是定义稀疏数组中第0行的元素
for (int i = 0; i < array1.length; i++) {
for (int j = 0; j < array1.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 i = 0; i < array2.length; i++) {
for (int j = 0; j < array2.length; j++) {
System.out.print(array2[i][j]+"\t");
}
System.out.println();
}
//还原稀疏数组,定义被还原的数组array3
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];
//array2[i][0]表示还原数组array3的第i行
//array2[i][1]表示还原数组array3的第j列
//array2[i][2]表示还原数组array3的第i行,第j列的数值。
}
System.out.println("输出还原数组:=======================");
for (int i = 0; i < array3.length; i++) {
for (int j = 0; j < array3.length; j++) {
System.out.print(array3[i][j]+"\t");
}
System.out.println();
}
}
}
浙公网安备 33010602011771号