如何在迷宫求解算法中从错误的路径返回？(Java)

import java.util.ArrayList;
import java.util.List;

public class MazeSolver {
    private int[][] maze;
    private int[][] solution;
    private int size;

    public MazeSolver(int[][] maze) {
        this.maze = maze;
        this.size = maze.length;
        this.solution = new int[size][size];
    }

    public boolean solveMaze() {
        if (solve(0, 0)) {
            printSolution();
            return true;
        }
        System.out.println("No solution found.");
        return false;
    }

    private boolean solve(int x, int y) {
        // Check if (x, y) is a valid position
        if (x < 0 || x >= size || y < 0 || y >= size || maze[x][y] == 0 || solution[x][y] == 1) {
            return false;
        }

        // Mark the current position as part of the solution path
        solution[x][y] = 1;

        // Check if we have reached the destination
        if (x == size - 1 && y == size - 1) {
            return true;
        }

        // Try moving in all four directions (up, down, left, right)
        if (solve(x + 1, y) || solve(x, y + 1) || solve(x - 1, y) || solve(x, y - 1)) {
            return true;
        }

        // If none of the directions lead to the destination, backtrack
        solution[x][y] = 0;
        return false;
    }

    private void printSolution() {
        for (int i = 0; i < size; i++) {
            for (int j = 0; j < size; j++) {
                System.out.print(solution[i][j] + " ");
            }
            System.out.println();
        }
    }

    public static void main(String[] args) {
        int[][] maze = {
                {1, 0, 1, 1, 1},
                {1, 0, 1, 0, 1},
                {1, 1, 1, 0, 1},
                {0, 0, 0, 0, 1},
                {1, 1, 1, 1, 1}
        };

        MazeSolver solver = new MazeSolver(maze);
        solver.solveMaze();
    }
}