在java中使用递归从文件中解算迷宫

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;

public class MazeSolver {
    private static char[][] maze;
    private static int rows;
    private static int cols;

    public static void main(String[] args) {
        // 读取迷宫数据
        readMazeFromFile("maze.txt");

        // 解算迷宫
        solveMaze(0, 0);

        // 输出解算结果
        printMaze();
    }

    private static void readMazeFromFile(String filename) {
        try (BufferedReader br = new BufferedReader(new FileReader(filename))) {
            String line = br.readLine();
            String[] size = line.split(" ");
            rows = Integer.parseInt(size[0]);
            cols = Integer.parseInt(size[1]);
            maze = new char[rows][cols];

            for (int i = 0; i < rows; i++) {
                line = br.readLine();
                maze[i] = line.toCharArray();
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static boolean solveMaze(int row, int col) {
        // 判断是否越界
        if (row < 0 || row >= rows || col < 0 || col >= cols) {
            return false;
        }

        // 判断是否为墙壁或已访问过的位置
        if (maze[row][col] == '#' || maze[row][col] == '*') {
            return false;
        }

        // 判断是否为出口
        if (maze[row][col] == 'E') {
            return true;
        }

        // 标记当前位置为已访问
        maze[row][col] = '*';

        // 尝试向上、下、左、右四个方向移动
        if (solveMaze(row - 1, col) || solveMaze(row + 1, col) ||
                solveMaze(row, col - 1) || solveMaze(row, col + 1)) {
            return true;
        }

        // 标记当前位置为未访问
        maze[row][col] = '.';

        return false;
    }

    private static void printMaze() {
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                System.out.print(maze[i][j] + " ");
            }
            System.out.println();
        }
    }
}