java寻找迷宫路径的简单实现示例

import java.util.Scanner;

public class Maze {
  private MazeNode[][] mazenode;
  private int row ;//行
  private int colum;//列
  public Maze(){


  }
  public void innode(){//添加迷宫路径；
    Scanner scanner=new Scanner(System.in);
    System.out.println("请输入迷宫行数和列数");
    row=scanner.nextInt()+2;//为后面加围墙
    colum=scanner.nextInt()+2;
    System.out.println("请输入迷宫路径：");
    mazenode=new MazeNode[row][colum];
    build(mazenode);//创建一个row行colum列的mazenode并且把value值都给1
    for(int i=1;i<row-1;i++){//为围墙内value赋值；
      for(int j=1;j<colum-1;j++){
      mazenode[i][j].value=scanner.nextInt();

  }
    }
  }
//创建围墙；
  public void build(MazeNode[][] mazenode){
    for(int i=0;i<row;i++){
      for(int j=0;j<colum;j++){
        mazenode[i][j]=new MazeNode(1,i,j);
      }
    }
  }
  public void goMaze(){//走迷宫
    innode();
    MyStack route=new MyStack();//存放路径的盏
    if(mazenode[1][1].value==0){//判断入口是否可走；
    route.push(mazenode[1][1]);
    }else {System.out.println("迷宫入口路径错误");
    }
    if(mazenode[row-2][colum-2].value!=0){//判断终点是否正确
      System.out.println("迷宫终点错误");
    }
    for(int i=1,j=1;;){//起点
      i=route.gettop().index1;//赋值栈顶元素的下标一给i
      j=route.gettop().index2;//赋值栈顶元素的下标二给j
      if(i==row-2&&j==colum-2){
        break;
      }//抵达终点退出循环
        if(mazenode[i][j].right(mazenode,i,j+1)){//判断右边是否可走
          if(route.contain(route,mazenode,i,j+1)){//判断右边是否在栈内
            mazenode[i][j].changeValue(mazenode,i,j);
            route.pop(mazenode[i][j]);//如果存在退栈
          }else {
          route.push(mazenode[i][j+1]);//如果不存在入栈的右边
          }
        } else if(i+1<row&&mazenode[i][j].down(mazenode,i+1,j)){
          if(route.contain(route,mazenode,i+1,j)){//判断下边是否在栈内
            mazenode[i][j].changeValue(mazenode,i,j);
            route.pop(mazenode[i+1][j]);退栈
          }else {
          route.push(mazenode[i+1][j]);
          }
        }else if(i+1<row&&mazenode[i][j].left(mazenode,i,j-1)){
          if(route.contain(route,mazenode,i,j-1)){//判断左边是否在栈内
            mazenode[i][j].changeValue(mazenode,i,j);
            route.pop(mazenode[i][j]);退栈
          }else{
          route.push(mazenode[i][j-1]);
          }
        }else if(i+1<row&&mazenode[i][j].up(mazenode,i-1,j)){
          if(route.contain(route,mazenode,i-1,j)){//判断上边是否在栈内
            mazenode[i][j].changeValue(mazenode,i,j);
            route.pop(mazenode[i][j]);退栈
          }else{
          route.push(mazenode[i-1][j]);
          }
        }
    }
    route.toRoute();//修改路径的值
    for(int i=1;i<row-1;i++){//进行打印
      for(int j=1;j<colum-1;j++){
        System.out.print(mazenode[i][j].value+" ");
      }
      System.out.println();
    }
  }
}

public class MazeNode {
  public int index1;
  public int index2;
  public int value;
  public MazeNode(int value,int index1,int index2) {
    this.value=value;
    this.index1=index1;//下标1
    this.index2=index2;//下标2
  }
  //改变找个点的值为2
  public void changeValue(MazeNode[][] mazeNode,int index1,int index2){

    mazeNode[index1][index2].value=2;
  }
  //判断左边是否可走
  public boolean left(MazeNode[][] mazeNode,int index1,int index2){
    if(mazeNode[index1][index2].value==0){
    return true;
    }return false;
  }
  //判断上边是否可走
  public boolean up(MazeNode[][] mazeNode,int index1,int index2){
    if(mazeNode[index1][index2].value==0){
      return true;
    }return false;
  }
  //判断右边是否可走
  public boolean right(MazeNode[][] mazeNode,int index1,int index2){
    if(mazeNode[index1][index2].value==0){
      return true;
    }return false;
  }
  //判断下边是否可走
  public boolean down(MazeNode[][] mazeNode,int index1,int index2){
    if(mazeNode[index1][index2].value==0){
      return true;
    }return false;
  }
}

import java.util.Arrays;
import java.util.EmptyStackException;

public class MyStack {
  private PuzzleValue[]array2;
  private MazeNode[]array;
  private int size;
  private final int INITSIZE=10;
  public MyStack(){
    array=new MazeNode[INITSIZE];
    array2=new PuzzleValue[INITSIZE];

  }
  //查找栈内是否存在此路径
  public boolean contain(MyStack stack,MazeNode[][] mazeNode,int index1,int index2){

    for(int i=0;i<size;i++){
      if(array[i].index1==index1&&array[i].index2==index2){
        return true;
      }
      }
    return false;
  }
  //入栈
  public void push(MazeNode mazeNode){
    if(array.length==size){
      array= Arrays.copyOf(array,array.length+(array.length>>1));
    }else {
    array[size]=mazeNode;
    size++;
    }
  }
  //出栈
  public void pop(MazeNode mazeNode){
    if(size==0){
      return;
    }else{
      array[size]=null;
      size--;
    }

  }
  //获得栈顶元素
  public MazeNode gettop(){
    return array[size-1];
  }
  //改变栈内的value值
  public void toRoute(){
    for(int i=0;i<size;i++){
      array[i].value=3;
    }
  }
  }