forked from sachinSingh16-09/Hacktoberfest-2023
-
Notifications
You must be signed in to change notification settings - Fork 1
/
maze.java
80 lines (69 loc) · 1.54 KB
/
maze.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
public class MazeLevel01 {
private char[][] m;
private int x, y;
public MazeLevel01(char[][] a, int r, int c) {
m = a;
x = r;
y = c;
}
public void display() {
for(int i = 0; i<m.length; i++) {
for(int j = 0; j<m[0].length; j++) {
System.out.print(m[i][j] + " ");
}
System.out.println();
}
}
public boolean findExit() {
return findExit(x, y);
}
public boolean findExit(int r, int c) {
boolean bool1 = false, bool2 = false, bool3=false, bool4=false;
if(r-1 != -1 && m[r-1][c] == ' ') {
m[r-1][c] = '&';
if(r - 1 == 0) { //base or stopping condition
x = r - 1;
y = c;
return true;
}
bool1 = findExit(r-1, c);
}
if(r+1 != m.length && m[r+1][c] == ' ') {
m[r+1][c] = '&';
if(r == m.length-1) { //base or stopping condition
x = r + 1;
y = c;
return true;
}
bool2 = findExit(r+1, c);
}
if(c-1 != -1 && m[r][c-1] == ' ') {
m[r][c-1] = '&';
if(c == 0) { // base or stopping condition
x = r + 1;
y = c;
return true;
}
bool3 = findExit(r, c-1);
}
if(c+1 != m[0].length && m[r][c+1] == ' ') {
m[r][c+1] = '&';
if(c == m[0].length-1) { // base or stopping condition
x = r + 1;
y = c;
return true;
}
bool4 = findExit(r, c+1);
}
if(bool1|| bool2||bool3||bool4) return true;
else{
return false;
}
}
public int getIExit() {
return x;
}
public int getJExit() {
return y;
}
}