1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
| package com.dataStructer1.xishuArray;
public class arrayToxishu {
public static void main(String[] args) {
int[][] chessArray1=new int[11][11];
chessArray1[1][2]=1;
chessArray1[2][3]=2;
chessArray1[2][4]=1;
System.out.println("数组为");
for (int[] row:chessArray1){
for (int d:row){
System.out.printf("%d\t", d);
}
System.out.println("\r");
}
int No0sum=0;
for (int i=0;i<11;i++){
for (int j = 0; j < 11; j++) {
if (chessArray1[i][j] != 0) {
No0sum++;
}
}
}
int [][]sparseArr=new int[No0sum+1][3];
sparseArr[0][0]=11;
sparseArr[0][1]=11;
sparseArr[0][2]=No0sum;
int count=0;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
if (chessArray1[i][j]!=0){
count++;
sparseArr[count][0]=i;
sparseArr[count][1]=j;
sparseArr[count][2]=chessArray1[i][j];
}
}
}
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]);
}
int ResultArr[][]=new int[sparseArr[0][0]][sparseArr[0][1]];
int valueNum=sparseArr[0][2];
for (int i = 1; i <sparseArr.length; i++) {
ResultArr[sparseArr[i][0]][sparseArr[i][1]]=sparseArr[i][2];
}
System.out.println("===============将稀疏数组还原成二位数组==============\r");
for (int row[]:ResultArr){
for (int value:row){
System.out.printf("%d\t",value);
}
System.out.println();
}
}
}
|
