js迷宫深度优先

function dfs(maze, start, end) {
    const rows = maze.length;
    const cols = maze[0].length;
    const visited = new Set();
    const path = [];

    function explore(row, col) {
        if (row < 0 || row >= rows || col < 0 || col >= cols || maze[row][col] === 1 || visited.has(`${row},${col}`)) {
            return false; // 越界、墙壁或已访问
        }

        visited.add(`${row},${col}`);
        path.push([row, col]);

        if (row === end[0] && col === end[1]) {
            return true; // 到达终点
        }

        // 上下左右四个方向探索
        const directions = [[-1, 0], [1, 0], [0, -1], [0, 1]];
        for (const [dr, dc] of directions) {
            if (explore(row + dr, col + dc)) {
                return true;
            }
        }

        // 回溯
        path.pop();
        return false;
    }

    return explore(start[0], start[1]) ? path : null;
}

// 示例迷宫，0表示通路，1表示墙壁
const maze = [
    [0, 1, 0, 0, 0],
    [0, 1, 0, 1, 0],
    [0, 0, 0, 1, 0],
    [1, 1, 1, 1, 0],
    [0, 0, 0, 0, 0]
];

const start = [0, 0];
const end = [4, 4];

const solutionPath = dfs(maze, start, end);
console.log(solutionPath); // 输出解决方案路径