java day11 稀疏数组

稀疏数组

public class Hello {
    public static void main(String[] args) {
        //1.创建一个二维数组11*11
        int[][] array1 = new int[11][11];
        array1[1][2] = 1;
        array1[2][3] = 2;
        //2.输出原始数组
        System.out.println("输出原始数组");
        for (int[] ints : array1) {//ints 相当于array1的每一行
            for (int anInt : ints) {//anInt相当于每一个元素
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
        //3.获取有效数值
        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);
        //4.创建一个稀疏矩阵数组
        int[][] array2 = new int[sum+1][3];
        array2[0][0] = 11;
        array2[0][1] = 11;
        array2[0][2] = 2;
        //5.遍历二位数组，有非零值，存放在稀疏矩阵中
        int cout = 0;
        for(int i =0;i<array1.length;i++){
            for(int j =0;j<array1[i].length;j++){
                if(array1[i][j]!=0){
                    cout++;
                    array2[cout][0] = i;
                    array2[cout][1] = j;
                    array2[cout][2] = array1[i][j];
                }
            }
        }
        //6.输出稀疏数组
        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" );
        }
        //7.读取稀疏矩阵
        int[][] array3 = new int[array2[0][0]][array2[0][1]];
        //8.给其他元素还原
        for(int i = 1;i< array2.length;i++){
            array3[array2[i][0]][array2[i][1]] = array2[i][2];
        }
        //9.打印
        System.out.println("还原数组：");
        for (int[] ints : array3) {//ints 相当于array1的每一行
            for (int anInt : ints) {//anInt相当于每一个元素
                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	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	0	0	
0	0	0	0	0	0	0	0	0	0	0	
有效个数2
稀疏数组：
11	11	2	
1	2	1	
2	3	2	
还原数组：
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	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	0	0	
0	0	0	0	0	0	0	0	0	0	0