使用递归方法穿越迷宫

这是我在书上看到的一个用递归方法做的一个穿越迷宫的程序，发来大家共同学习

public class MazeSearch
{
public static void main(String [] args)
    {
        Maze labyrinth = new Maze();
        System.out.println(labyrinth);
if(labyrinth.traverse(0,0))
            System.out.println("The maze was successfully tranversed!");
else
            System.out.println("There is no possible path.");

        System.out.println(labyrinth);
    }
}

　　

public class Maze
{
private final int TRIED = 3;
private final int PATH = 7;
private int[][] grid = {
        {1,1,1,0,1,1,1,0,0,1,1,1,1},
        {1,0,1,1,1,0,1,1,1,1,0,0,1},
        {0,0,0,0,1,0,1,0,1,0,1,0,0},
        {1,1,1,0,1,0,1,0,1,0,1,1,1},
        {1,0,1,0,0,0,0,1,1,1,0,0,1},
        {1,0,1,1,1,1,1,1,0,1,1,1,1},
        {1,0,0,0,0,0,0,0,0,0,0,0,0},
        {1,1,1,1,1,1,1,1,1,1,1,1,1}
                                                };
public boolean traverse(int row,int column)
    {
boolean done = false;
if(valid(row,column))
        {
            grid[row][column] = TRIED;

if(row == grid.length-1&&column==grid[0].length-1)
                done = true;
else
            {
                done = traverse(row+1,column);
if(!done)
                    done = traverse(row,column+1);
if(!done)
                    done = traverse(row-1,column);
if(!done)
                    done = traverse(row,column-1);
            }
if(done)
                grid[row][column] = PATH;

        }
return done;
    }
private boolean valid (int row,int column)
    {
boolean result = false;
if(row>=0&&row<grid.length&&column>=0&&column<grid[row].length)
if(grid[row][column]==1)
            result = true;
return result;
    }
public String toString ()
    {
        String result = "\n";
for(int row = 0;row<grid.length;row++)
        {
for (int column=0;column<grid[row].length ;column++ )
                result += grid[row][column]+"";
                result += "\n";

        }
return result;
    }

}

　　这是运行结果

刚开始学习java，水平不高欢迎指点

转载于:https://www.cnblogs.com/shys/archive/2011/09/01/2162239.html