Saturday, January 29, 2022

Get Maze Paths With Jumps











import java.util.ArrayList;

public class GetMazePathWithJumps {
public static void main(String[] args) throws Exception {
ArrayList<String> ans = getMazePaths(0, 0, 2, 2);
System.out.println(ans);
}

// sr - source row
// sc - source column
// dr - destination row
// dc - destination column
public static ArrayList<String> getMazePaths(int sr, int sc, int dr, int dc) {
if (sr == dr && sc == dc) {
ArrayList<String> bres = new ArrayList<>();
bres.add("");
return bres;
}

ArrayList<String> ans = new ArrayList<>();

for (int moveSize = 1; moveSize <= dc - sc; moveSize++) {
ArrayList<String> horizontal = getMazePaths(sr, sc + moveSize, dr, dc);
for (String h : horizontal)
ans.add(h + "h" + moveSize);
}

for (int moveSize = 1; moveSize <= dr - sr; moveSize++) {
ArrayList<String> vertical = getMazePaths(sr + moveSize, sc, dr, dc);
for (String v : vertical)
ans.add(v + "v" + moveSize);
}

for (int moveSize = 1; moveSize <= dr - sr && moveSize <= dc - sc; moveSize++) {
ArrayList<String> diagonal = getMazePaths(sr + moveSize, sc + moveSize, dr, dc);
for (String d : diagonal)
ans.add(d + "d" + moveSize);
}

return ans;
}

} 

No comments:

Post a Comment

Diagonal Traversal

 eg.  1       2       3       4 5      6       7       8 9    10    11     12 13  14   15    16 Output: 1 6 11 16 2 7 12 3 8 4  Approach:...