We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d13460d commit d150991Copy full SHA for d150991
java2/dsa/recursion/maze/MazeSolver.java
@@ -62,11 +62,11 @@ public static boolean walk(
62
private static char[][] getMaze() {
63
char[][] maze = {
64
new char[] {'#', '#', '#', '#', '#', '#', '#'},
65
- new char[] {' ', ' ', ' ', ' ', '#', ' ', 'E'},
66
- new char[] {' ', '#', '#', ' ', ' ', ' ', '#'},
67
- new char[] {' ', ' ', ' ', '#', '#', '#', '#'},
+ new char[] {'#', ' ', ' ', ' ', '#', ' ', 'E'},
+ new char[] {'#', ' ', '#', ' ', ' ', ' ', '#'},
+ new char[] {'#', ' ', ' ', '#', '#', '#', '#'},
68
new char[] {'#', '#', ' ', '#', '#', '#', '#'},
69
- new char[] {'#', ' ', '#', '#', '#', '#', '#'},
70
new char[] {'#', 'S', '#', '#', '#', '#', '#'}
71
};
72
return maze;
0 commit comments