稀疏数组还原

稀疏数组

package com.wpx.array;

public class Demo03 {
    public static void main(String[] args) {
        //稀疏数组
        int[][] arr1 = new int[11][11];
        arr1[1][2] =1;
        arr1[2][3] =2;
        System.out.println("输出原始的数组:");
        for(int[] arr : arr1){
            for(int aaa : arr){
                System.out.print(aaa + "\t");
            }
            System.out.println();
        }
        //转换为稀疏数组
        //获取有效值的个数
        int num = 0;
        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++) {
                if(arr1[i][j] != 0){
                    num++;
                }
            }
        }
        System.out.println("有效值的个数：" + num);

        //创建一个稀疏数组的数组
        int[][] arr2 = new int[num + 1][3];
        arr2[0][0] = 11;
        arr2[0][1] = 11;
        arr2[0][2] = num;
        int count = 0;
        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++) {
                if(arr1[i][j] != 0){
                    count++;
                    arr2[count][0] = i;
                    arr2[count][1] = j;
                    arr2[count][2] = arr1[i][j];
                }
            }
        }
        System.out.println("稀疏数组为：");
        for(int i = 0; i < arr2.length; i++){
            for(int j = 0; j < arr2[i].length; j++){
                System.out.print(arr2[i][j] + "\t");
            }
            System.out.println();
        }

        //还原稀疏数组
        int[][] arr3 = new int[arr2[0][0]][arr2[0][1]];
        for(int i = 1; i < arr2.length; i++){
            for (int j = 0; j < arr2[i].length; j++) {
                arr3[i][arr2[i][1]] = arr2[i][2];
            }
        }
        System.out.println("原始数组为：");
        for (int i = 0; i < arr3.length; i++) {
            for (int j = 0; j < arr3[i].length; j++) {
                System.out.print(arr3[i][j] + "\t");
            }
            System.out.println();
        }
    }
}