棋盘数组转稀疏存入磁盘并解析

最新推荐文章于 2024-09-13 17:30:19 发布

佞人

最新推荐文章于 2024-09-13 17:30:19 发布

阅读量87

点赞数

文章标签： java 算法

本文链接：https://blog.csdn.net/qq_46071172/article/details/111596528

版权

//创建二维数组
        int arr[][] = new int[11][11];
        //初始化
        arr[1][2] = 1;
        arr[2][3] = 2;
        arr[4][9] = 999;
        arr[6][6] = 666;
        System.out.println("原始棋盘：");

        for (int i = 0;i < arr.length;i++){
            for (int j = 0;j<arr[i].length;j++){
                System.out.print(arr[i][j]+"\t");
            }
            System.out.println();
        }
        //计算有效数字的个数
        int sum = 0;
        for (int[] ints : arr) {
            for (int anInt : ints) {
                if (anInt != 0){
                    sum++;
                }
            }
        }
        System.out.println("有效数字个数：sum="+sum);

        //创建稀疏数组
        int[][] spareArray = new int[sum+1][3];
        //初始化稀疏数组
        spareArray[0][0] = 11;
        spareArray[0][1] = 11;
        spareArray[0][2] = sum;
        //遍历二维数组给稀疏数组赋值
        int cou = 0;
        for (int i = 0;i < arr.length;i++){
            for (int j = 0;j<arr[i].length;j++){

                if (arr[i][j] != 0){
                    cou++;
                    spareArray[cou][0] = i;
                    spareArray[cou][1] = j;
                    spareArray[cou][2] = arr[i][j];
                }
            }
        }
        //将稀疏数组存入磁盘
        File file = new File("E:\\map.txt");
        file.createNewFile();
        FileWriter fw = new FileWriter(file);
        System.out.println("稀疏棋盘：");
        for (int i = 0;i<spareArray.length;i++){
            for (int j = 0;j < spareArray[i].length;j++){
                fw.write(spareArray[i][j]+"\t");
                System.out.print(spareArray[i][j]+"\t");
            }
            fw.write("\r\n");
            System.out.println();
        }
        fw.close();

        //从磁盘读取稀疏数组并创建
        BufferedReader br = new BufferedReader(new FileReader(file));
        String[] split = null;
        String line;
        int row = 0;
        while ((line = br.readLine()) != null){
            row++;
        }
        int[][] spareArray1 = new int[row][3];
        row = 0;
        br.close();
        BufferedReader br1 = new BufferedReader(new FileReader(file));
        while ((line = br1.readLine()) != null){
            split = line.split("\t");
            for (int i = 0;i<split.length;i++){
                spareArray1[row][i] = Integer.parseInt(split[i]);
            }
            row++;
        }
        br.close();

        System.out.println("读取后的稀疏数组：");
        for (int[] s : spareArray1) {
            for (int i : s) {
                System.out.print(i+"\t");
            }
            System.out.println();
        }

        //解析稀疏棋盘
        //创建棋盘
        int[][] newarr = new int[spareArray1[0][0]][spareArray1[0][1]];
        //给棋盘赋值
        for (int i = 1;i < spareArray1.length;i++){
            newarr[spareArray1[i][0]][spareArray1[i][1]] = spareArray1[i][2];
        }

        System.out.println("还原后的数组：");
        for (int[] ints : newarr) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }