稀疏数组

稀疏数组

实例

package com.yang.array;

public class ArrayDemo06 {
    public static void main(String[] args) {
        //创建一个11行11列的数组，其中 1:黑棋 2:白旗
        int array1[][] = new int[11][11];
        array1[1][2] = 1;
        array1[2][3] = 2;
        array1[5][6] = 52;
        array1[4][5] = 4;
        //输出原始数组
        System.out.println("输出原始数组");
        for (int[] ints : array1) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
        System.out.println("===========================");
        //转换为稀疏数组保存
        //算出有效个数
        int sum =0;
        for (int i = 0; i <11 ; i++) {
            for (int j = 0; j <11 ; j++) {
               if (array1[i][j]!=0){
                   sum++;
               }


            }
        }
        System.out.println("有效个数的值为："+sum);
        //创建一个稀疏数组
        int [][] array2 = new int[sum+1][3];
        array2[0][0]=11;
        array2[0][1]=11;

        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;
                   System.out.println("遍历原数组--->"+count+"-0:"+i);
                   array2[count][1]=j;
                   System.out.println("遍历原数组--->"+count+"-1:"+j);
                   array2[count][2]=array1[i][j];
                   System.out.println("遍历原数组--->"+count+"-2:"+array1[i][j]);
               }
            }
        }
        //输出稀疏数组
        System.out.println("输出稀疏数组");
        for (int i = 0; i <array2.length ; i++) {
            System.out.println(array2[i][0]+"\t"+
                    array2[i][1]+"\t"+array2[i][2]+"\t");
        }
        //还原稀疏数组
        //读取稀疏数组
        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 anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();

        }
    }

}

结果

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	4	0	0	0	0	0	
0	0	0	0	0	0	52	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	
===========================
有效个数的值为：4
遍历原数组--->1-0:1
遍历原数组--->1-1:2
遍历原数组--->1-2:1
遍历原数组--->2-0:2
遍历原数组--->2-1:3
遍历原数组--->2-2:2
遍历原数组--->3-0:4
遍历原数组--->3-1:5
遍历原数组--->3-2:4
遍历原数组--->4-0:5
遍历原数组--->4-1:6
遍历原数组--->4-2:52
输出稀疏数组
11	11	4	
1	2	1	
2	3	2	
4	5	4	
5	6	52	
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	4	0	0	0	0	0	
0	0	0	0	0	0	52	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