ArrayIndexOutOfBounds Java（现在堆栈溢出错误！？）

Question

我正在尝试编写一个程序，该程序返回是/否，无论迷宫是否可遍历，但不断收到此异常...怎么了？我怎样才能阻止这种情况发生？ （我想尽可能保持这种结构）

迷宫：

WWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWW
WSOOOOOOOOOOOOOOWOOOOOOOOOOOOOOOOOWOOOOOOOOOOOOOOOWOOOOOOW
WWOOOOOOOOOOOOOWWWWWWWWWWWWWOOOOOOOOOOWWWWWWWWWWWWWOOOOOOW
WWWWWWOOOOOOOOOOOOWWWWWWWOOOOOOOOOOOOWWWWWWWWWWWWWWWWOOOOW
WOOOOOOWWWWWWWWWWWWWWOOOOOOOOOOOWWWWWWWWOOOOOOOOOOOOOOOWWW
WOOOOWWWWWWWOOOOOOWWWWOOOOOOWWWWWWWWWWWOOOOWWWWWWWWWOWWWWW
WOOOWWWWWWWWWWWWOOWWWWWWWWWWWWOOOOOOOOOOOOWWWWWWWWWOOOOOWW
WOOWWWWWWWWWWWWWOOWWWWWWWWWWWWWWWWWOOOOOOOWWWWWWWWWWWWOOOW
WOWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWOOOOOOOWWWWWWWWWWWOOW
WOWWWWWWWWWWWWWOOOOOOOOOOOOOOOOOOOOOOOOOOOOWWWWWWWWWWWWOOW
WOOOOOOOOOOOOOOOOWWWWOOOOOOOOWWWWWWWOOOOOOWWWWWWWWWWWWWWFW
WWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWW

新代码：

import java.io.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Stack;
import java.awt.Point;

public class MazeExplorer {
    static Point startPoint = new Point();
    static Point finishPoint = new Point();
    final static int mazeHeight = 12;
    final static int mazeWidth = 58;
    static char[][] mazePoints = new char[mazeHeight][mazeWidth];
    Stack<Point> pointsNotTraversed = new Stack<Point>();
    Point pt = new Point();
    static HashSet<Point> previousLocations = new HashSet<Point>();
    static Stack<Point> nextPoints = new Stack<Point>();

    public static void main(String[] args) throws FileNotFoundException{

        System.out.println("Please enter the file name of your Maze");
        Scanner console = new Scanner(System.in);
        File f = new File(console.nextLine());
        Scanner sc = new Scanner(f);

        if(!sc.hasNextLine()){
            System.out.println("Sorry, please enter a file name with the extension, that contains a maze!");
        }
        System.out.println("So, you want to know if your maze is solvable.....?");

        for (int row = 0; row < mazeHeight && sc.hasNext(); row++) {
            final String mazeRow = sc.next(); //Get the next row from the scanner.
            mazePoints[row] = mazeRow.toCharArray(); //Convert the row into a char[].
        }
            //identify the finish point
        for(int i = 0; i < mazeHeight; i++){
            for(int j = 0; j<mazeWidth; j++){
                if(mazePoints[i][j] == 'F'){
                    finishPoint = new Point(i, j);
                }       
            }
        }
        // Identify the start point
       for(int i = 0; i< mazeHeight; i++){
           for(int j = 0; j < mazeWidth; j++){
               if(mazePoints[i][j] == 'S'){
                 startPoint = new Point(i , j);
               }
           }
       }
       isTraversable(startPoint);    
    }
        public static  boolean isTraversable(Point current){
            boolean isSolvable = false;
            nextPoints.push(current);

            do {


                if(current.y < 11) {
                    if((mazePoints[current.y + 1][current.x] != ' ') && (mazePoints[current.y + 1][current.x] != 'W') ){ // below direction
                    nextPoints.push(new Point(current.y + 1, current.x));
                    mazePoints[current.y + 1][current.x] = ' ';        
                    isTraversable(nextPoints.pop());    

                }
                }
                if(current.y > 0){


                if (mazePoints[current.y - 1][current.x] != ' ' && mazePoints[current.y - 1][current.x] != 'W' ){ //up dir
                   nextPoints.push(new Point(current.y - 1, current.x));
                    mazePoints[current.y - 1][current.x] = ' ';  //'X' marks where you've already been
                   isTraversable(nextPoints.pop());     

                }
                }
                if(current.x < 57){
                if(mazePoints[current.y][current.x + 1] != ' ' && mazePoints[current.y][current.x + 1] != 'W'){ // to the right
                    nextPoints.push(new Point(current.y, current.x + 1));
                    mazePoints[current.y][current.x + 1] = ' ';
                    isTraversable(nextPoints.pop());    

                }
                }
                if(current.x > 0){


                if(mazePoints[current.y][current.x - 1] != ' ' && mazePoints[current.y][current.x - 1] != 'W') { // to the left
                    nextPoints.push(new Point(current.y, current.x - 1));
                    mazePoints[current.y][current.x - 1] = ' ';     
                    isTraversable(nextPoints.pop());    

                }
                }
                if(current.equals(finishPoint)){
                    isSolvable = true;
                    System.out.println("MAZE IS SOLVABLE, YAHOOOOOO!!!!");
                }




            } while(!current.equals('F') && !nextPoints.isEmpty());    


            return isSolvable;          
        }
}

Answer 1

 if(current.x < 58){
                if(mazePoints[current.y][current.x + 1] == 'O'){ // to the right
                    nextPoints.push(new Point(current.y, current.x + 1));
                    mazePoints[current.y][current.x + 1] = ' ';
                }
                }

当 current.x = 57 时，您会得到数组索引绑定异常，将 58 替换为 57，因为您执行 current.x + 1 并且 58 indx 不存在

Answer 2

发生这种情况是因为您的递归方法没有得到正确考虑。我冒昧地清理了一些方法，以便您可以看到它应该是什么样子。

我知道递归可能是一个棘手的话题，但如果你打算有效地学习，你会想要理解代码或更多地练习递归。

public static  boolean isTraversable(Point current){
        boolean isSolvable = false;
        mazePoints[current.x][current.y] = ' ';

        if(current.y < 57 && current.y > 0 && current.x > 0 && current.x < 12){
            if (mazePoints[current.x - 1][current.y] == 'O'){ // Up dir
                Point upPoint = new Point(current.x-1, current.y);
                nextPoints.push(upPoint);
            }

            if(mazePoints[current.x+1][current.y] == 'O'){ // Down dir
                Point downPoint = new Point(current.x+1, current.y);
                nextPoints.push(downPoint);
            }

            if(mazePoints[current.x][current.y + 1] == 'O'){ // to the right
                Point rightPoint = new Point(current.x, current.y+1);
                nextPoints.push(rightPoint);
            }

            if(mazePoints[current.x][current.y - 1] == 'O'){ // to the left
                Point leftPoint = new Point(current.x, current.y-1);
                nextPoints.push(leftPoint);
            }

            if(mazePoints[current.x - 1][current.y] == 'F' ||
               mazePoints[current.x + 1][current.y] == 'F' ||
               mazePoints[current.x][current.y - 1] == 'F' ||
               mazePoints[current.x][current.y + 1] == 'F'){
                System.out.println("MAZE IS SOLVABLE, YAHOOOOOO!!!!");
                return true;
            }

        }

        if(nextPoints.isEmpty()){
            return false;
        }
        else{
            current = nextPoints.pop();
        }

        return(isTraversable(current));

    }