-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTheMazeBasics.java
More file actions
216 lines (142 loc) · 4.26 KB
/
TheMazeBasics.java
File metadata and controls
216 lines (142 loc) · 4.26 KB
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
package com.vinay.practice.lc;
import java.util.ArrayList;
import java.util.List;
public class TheMazeBasics {
public static void main(String[] args) {
System.out.println(count(3,3));
path("", 3, 3);
System.out.println(pathRet("", 3, 3));
System.out.println();
System.out.println(countPathDiagonal(3,3));
System.out.println(pathRetDiagonal("", 3, 3));
System.out.println();
boolean[][] board3 = {
{true, true, true},
{true, false, true},
{true, true, true}
};
boolean[][] board4 = {
{true, true, true, true},
{true, false, true, true},
{true, true, false, true},
{true, true, true, true}
};
pathRestrictions(board4, "", 0, 0);
System.out.println(printPathRestrictions(board4, "", 0, 0));
// System.out.println(pathDiagonalRestrictions(board, "", 3, 3, 0, 0));
System.out.println();
System.out.println("Printing path with diagonal and restrictions");
System.out.println(printPathDiagonalRestrictions(board4, "", 0, 0));
}
// how many ways we can travel from starting point to ending point of the maze but not diagonal
// (you can only go right and down)
static int count(int r, int c) {
if(r == 1 || c == 1) {
return 1;
}
int left = count(r-1, c);
int right = count(r, c-1);
return left+right;
}
static void path(String p, int r, int c) {
if(r == 1 && c == 1) {
System.out.println(p);
return;
}
if(r > 1) {
path(p+"D", r-1, c);
}
if(c > 1) {
path(p+"R", r, c-1);
}
}
static List<String> pathRet(String p, int r, int c) {
if(r == 1 && c == 1) {
List<String> list = new ArrayList<String>();
list.add(p);
return list;
}
List<String> path = new ArrayList<String>();
if(r > 1) {
path.addAll(pathRet(p+"D", r-1, c));
}
if(c > 1) {
path.addAll(pathRet(p+"R", r, c-1));
}
return path;
}
static int countPathDiagonal(int r, int c) {
if(r == 1 || c == 1) {
return 1;
}
int diagonal = countPathDiagonal(r-1, c-1);
int left = countPathDiagonal(r-1, c);
int right = countPathDiagonal(r, c-1);
return diagonal+left+right;
}
static List<String> pathRetDiagonal(String p, int r, int c) {
if(r == 1 && c == 1) {
List<String> list = new ArrayList<String>();
list.add(p);
return list;
}
List<String> path = new ArrayList<String>();
if(r > 1 && c > 1) {
path.addAll(pathRetDiagonal(p+"D", r-1, c-1));
}
if(r > 1) {
path.addAll(pathRetDiagonal(p+"V", r-1, c));
}
if(c > 1) {
path.addAll(pathRetDiagonal(p+"H", r, c-1));
}
return path;
}
static void pathRestrictions(boolean[][] board, String p, int r, int c) {
if(r == board.length-1 && c == board[0].length-1) {
System.out.println(p);
return;
}
if(!board[r][c])
return;
if(r < board.length-1) {
pathRestrictions(board, p+"D", r+1, c);
}
if(c < board[0].length-1) {
pathRestrictions(board, p+"R", r, c+1);
}
}
static List<String> printPathRestrictions(boolean[][] board, String p, int r, int c) {
if(r == board.length-1 && c == board[0].length-1) {
List<String> list = new ArrayList<String>();
list.add(p);
return list;
}
List<String> path = new ArrayList<String>();
if(r < board.length-1 && board[r][c]) {
path.addAll(printPathRestrictions(board, p+"D", r+1, c));
}
if(c < board[0].length-1 && board[r][c]) {
path.addAll(printPathRestrictions(board, p+"R", r, c+1));
}
return path;
}
static List<String> printPathDiagonalRestrictions(boolean[][] board, String p, int r, int c) {
if(r == board.length-1 && c == board[0].length-1 && board[r][c]) {
List<String> list = new ArrayList<String>();
list.add(p);
return list;
}
List<String> path = new ArrayList<String>();
if(r > board.length && c > board[0].length && board[r][c]) {
path.addAll(printPathDiagonalRestrictions(board, p+"D", r+1, c+1));
}
if(r < board.length-1 && board[r][c]) {
path.addAll(printPathDiagonalRestrictions(board, p+"V", r+1, c));
}
if(c < board[0].length-1 && board[r][c]) {
path.addAll(printPathDiagonalRestrictions(board, p+"H", r, c+1));
}
return path;
}
}