package method_exercise;
public class ArrayDemo02 {
public static void main(String[] args) {
int[][] a=new int[6][6];
a[2][3]=6;
a[3][4]=9;
System.out.println("输出原有数组:");
for (int[] ints : a) {
for (int anInt : ints) {
System.out.print(anInt+" ");
}
System.out.println();
}
System.out.println("输出稀疏数组:");
int sum=0;
//获取有效值的个数
for (int i = 0; i < a.length; i++) {
for (int j = 0; j <a[i].length; j++) {
if (a[i][j]!=0){
sum++;
}
}
}
//创建一个稀疏数组
int[][] b=new int[sum+1][3];
int count=0;
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if (a[i][j]!=0){
count++;
b[count][0]=i;//看下标,也可以是i+1
b[count][1]=j;//看下标,也可以是j+1
b[count][2]=a[i][j];
}
}
}
for (int i = 1; i < b.length; i++) {
System.out.println(b[i][0]+"\t"
+b[i][1]+"\t"
+b[i][2]+"\t");
}
}
}
效果图: