- 实现二维数组向稀疏数组的转换
- 以及稀疏数组向二维数组的转换
代码块如下:
public static void main(String[] args) {
//创建一个原始二维数组,其中0表示没棋子,1表示白棋,2表示黑棋
int arr[][]=new int[11][11];
arr[2][1]=1;
arr[6][5]=1;
arr[3][4]=2;
arr[10][9]=2;
//显示原始二维数组
System.out.println("原始二维数组是:");
for (int arr01[]:arr
) {
for (int num:
arr01) {
System.out.printf("%d\t",num);
}
System.out.println();
}
//求其中的非零个数
System.out.print("其中的非零个数是:");
int sum=0;
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
if(arr[i][j]!=0){
sum++;
}
}
}
System.out.println(sum);
//创建稀疏数组
int sparseArray[][]=new int[sum+1][3];
sparseArray[0][0]=11;
sparseArray[0][1]=11;
sparseArray[0][2]=sum;
//给稀疏数组赋值
int count=0;
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
if (arr[i][j]!=0){
count++;
sparseArray[count][0]=i;
sparseArray[count][1]=j;
sparseArray[count][2]=arr[i][j];
}
}
}
//输出转化后的稀疏数组
System.out.println("转化后的稀疏数组是:");
for (int arr02[]:
sparseArray) {
for (int num02:
arr02) {
System.out.printf("%d\t",num02);
}
System.out.println();
}
//实现了由二维数组向稀疏数组的转换,现在来实现稀疏数组向二维数组的转换
int arr001[][]=new int[11][11];
for (int i = 1; i < sparseArray.length; i++) {
arr001[sparseArray[i][0]][sparseArray[i][1]]=sparseArray[i][2];
}
System.out.println("由稀疏数组转化后的二维数组是:");
for (int array[]:arr001
) {
for (int num0:
array) {
System.out.printf("%d\t",num0);
}
System.out.println();
}
}
}
运行结果
原始二维数组是:
0 0 0 0 0 0 0 0 0 0 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 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 1 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 2 0
其中的非零个数是:4
转化后的稀疏数组是:
11 11 4
2 1 1
3 4 2
6 5 1
10 9 2
由稀疏数组转化后的二维数组是:
0 0 0 0 0 0 0 0 0 0 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 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 1 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 2 0