JAVA Day13

Posted 2021-06-04 别来无恙。。

稀缺数组

JAVA Day13

稀疏数组

package struct;
public class Day13 {
    public static void main(String[] args) {
        int[][] array1 = new int[11][11];
        array1[1][2]=1;
        array1[2][3]=2;
        for(int[] ints:array1){
            for(int anInt:ints){
                System.out.print(anInt+"\\t");
            }
            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;//横坐标
                    array2[count][1] = j;//纵坐标
                    array2[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");
        }
        System.out.println("还原");
        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();
        }
    }
}