稀疏数组 存入/导出 磁盘（韩顺平老师Java数据结构与算法）

public static void main(String[] args) {
        //创建一个二维数组
        int[][] array = new int[11][11];
        array[1][2] = 1;
        array[2][3] = 2;

        //遍历array，把内容打印一下，并记录 有效数字 的个数
        int count = 0;
        for (int[] ints : array) {
            for (int anInt : ints) {
                System.out.print(anInt+"  ");
                if (anInt != 0){
                    count++;
                }
            }
            System.out.println();
        }


        //创建稀疏数组
        int[][] sparseArray = new int[count+1][3];
        //初始化第一行的值
        sparseArray[0][0] = 11;
        sparseArray[0][1] = 11;
        sparseArray[0][2] = count;
        //遍历二维数组找出有效数字，并赋给稀疏数组
        int temp = 1;
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                if (array[i][j] != 0){
                    sparseArray[temp][0] = i;
                    sparseArray[temp][1] = j;
                    sparseArray[temp][2] = array[i][j];
                    temp++;
                }
            }
        }

        System.out.println();
        //打印稀疏数组
        for (int[] ints : sparseArray) {
            for (int anInt : ints) {
                System.out.print(anInt+"  ");
            }
            System.out.println();
        }


        File f = new File("D:\\JavaProject\\Projects\\Java数据结构与算法\\src\\sparseArray.data");
        //使用字符流将稀疏数组存入磁盘
        try (FileWriter fw = new FileWriter(f)){    //这样写会自动关闭流
            for (int[] ints : sparseArray) {
                fw.write(ints[0]+","+ints[1]+","+ints[2]+",");
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
        //使用字符流从磁盘导出稀疏数组
        char[] chars = new char[(int) f.length()];
        try (FileReader fr = new FileReader(f)){    //这样写会自动关闭流
            fr.read(chars);
        } catch (IOException e) {
            e.printStackTrace();
        }
        String str = "";
        for (char aChar : chars) {
            str += aChar;
        }

        //创建稀疏数组
        int[][] sparseArray1 = new int[count+1][3];
        //初始化稀疏数组的数据
        String[] intTemp = str.split(",");

        int intCount = 0;
        for (int i = 0; i < sparseArray1.length; i++) {
            for (int j = 0; j < sparseArray1[i].length; j++) {
                sparseArray1[i][j] = Integer.parseInt(intTemp[intCount]);
                intCount++;
            }
        }

        //将稀疏数组还原成二维数组
        //根据稀疏数组创建二维数组
        int[][] array1 = new int[sparseArray1[0][0]]  [sparseArray1[0][1]];
        //遍历稀疏数组，还原二维数组
        for (int i = 1; i < sparseArray1.length; i++) {
            array1[sparseArray1[i][0]] [sparseArray1[i][1]] = sparseArray1[i][2];
        }


        System.out.println();
        //打印还原后的二维数组
        for (int[] ints : array1) {
            for (int anInt : ints) {
                System.out.print(anInt+"  ");
            }
            System.out.println();
        }

    }

data文件

运行结果