java 递归 老鼠出迷宫

package charpter07;

public class RecursionMiGong01 {
    public static void main(String[] args) {
        int arr[][] = new int[8][7];
        for(int i = 0; i < 7;i++){
            arr[0][i] = 1;
            arr[7][i] = 1;
        }
        for(int i = 0; i < 8;i++){
            arr[i][0] = 1;
            arr[i][6] = 1;
        }
        for(int i = 0; i < 7;i++){
            arr[3][1] = 1;
            arr[3][2] = 1;
        }
        System.out.println("======当前迷宫地图情况======");
        for(int i = 0;i < arr.length;i++){
            for(int j = 0;j < arr[i].length;j++){
                System.out.print(arr[i][j] + " ");
            }
            System.out.println();
        }
        mouse a = new mouse();
        a.findway(arr,3,4);
        System.out.println("======后来迷宫地图情况======");
        for(int i = 0;i < arr.length;i++){
            for(int j = 0;j < arr[i].length;j++){
                System.out.print(arr[i][j] + " ");
            }
            System.out.println();
        }


    }

}
class mouse{

    public boolean findway(int arr[][],int i,int j){
        if(arr[6][5] == 2){
            return true;
        }else {
            if(arr[i][j] == 0){
                arr[i][j] = 2;
                if(findway(arr,i + 1,j)){
                    return true;
                }else if(findway(arr,i,j + 1)){
                    return true;
                }else if(findway(arr,i,j - 1)){
                    return true;
                }else{
                    arr[i][j] = 3;
                    return false;
                }
            }else{
                return false;
            }
        }
    }
}