回溯算法之迷宫老鼠

迷宫老鼠问题

function ratInAMaze(maze){
    const solution = [];
    for(let i=0;i<maze.length;i++){
        solution[i] = [];
        for(let j=0;j<maze[i].length;j++){
            solution[i][j] = 0;
        }
    }
    if(findPath(maze,0,0,solution) === true) return solution;
    return 'NO PATH FOUND';

}
function findPath(maze,x,y,solution){
    const n = maze.length;
    if(x===n-1 && y===n-1){
        solution[x][y] = 1;
        return true;
    }
    if(isSafe(maze,x,y) === true){
        solution[x][y] = 1;
        if(findPath(maze,x+1,y,solution)){
            return true;
        }
        if(findPath(maze,x,y+1,solution)){
            return true;
        }
        solution[x][y] = 0;
        return false;
    }
    return false;
}
function isSafe(maze,x,y){
    const n = maze.length;
    if(x>=0 && y>=0 && x<n && y<n && maze[x][y]!=0){
        return true;
    }
    return false;
}
const maze = [
    [1,0,0,0],
    [1,1,1,1],
    [0,0,1,0],
    [0,1,1,1]
];
console.log(ratInAMaze(maze));