Repository navigation
Expand file tree
/
Copy pathMaze.java
More file actions
55 lines (49 loc) · 1.46 KB
/
Copy pathMaze.java
File metadata and controls
55 lines (49 loc) · 1.46 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
import java.util.ArrayList;
public class Maze {
public static void main(String[] args) {
System.out.println(pathcount(3, 3));
System.out.println(pathRet("", 3, 3));
System.out.println(pathRetDiagonal("", 3, 3));
}
static int pathcount(int r, int c) {
if (r == 1 || c == 1) {
return 1;
}
int left = pathcount(r-1, c);
int right = pathcount(r, c-1);
return left+right;
}
static ArrayList<String> pathRet(String p, int r, int c) {
if (r == 1 && c == 1) {
ArrayList<String> list = new ArrayList<>();
list.add(p);
return list;
}
ArrayList<String> list = new ArrayList<>();
if (r > 1) {
list.addAll(pathRet(p+"D",r-1, c));
}
if (c > 1) {
list.addAll(pathRet(p+"R", r, c-1));
}
return list;
}
static ArrayList<String> pathRetDiagonal(String p, int r, int c) {
if (r == 1 && c == 1) {
ArrayList<String> list = new ArrayList<>();
list.add(p);
return list;
}
ArrayList<String> list = new ArrayList<>();
if (r > 1 && c > 1 ) {
list.addAll(pathRetDiagonal(p+"D", r-1, c-1));
}
if (r > 1) {
list.addAll(pathRetDiagonal(p+"D",r-1, c));
}
if (c > 1) {
list.addAll(pathRetDiagonal(p+"R", r, c-1));
}
return list;
}
}