Saturday, January 29, 2022

Get Maze Path




import java.util.ArrayList;

public class GetMazePath {
public static void main(String[] args) {

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) {
// base case
if (sr > dc || sc > dc) {
return new ArrayList<>();
}
if (sr == dr && sc == dc) {
ArrayList<String> horizontal = new ArrayList<>();
horizontal.add("");
return horizontal;
}

ArrayList<String> horizontal = new ArrayList<>();
ArrayList<String> vertical = new ArrayList<>();

// faith: vertical
vertical = getMazePaths(sr + 1, sc, dr, dc);
// faith: horizontal
horizontal = getMazePaths(sr, sc + 1, dr, dc);

// expectation meet faith
ArrayList<String> ans = new ArrayList<>();

for (String h : horizontal)
ans.add(h + "h");

for (String v : vertical)
ans.add(v + "v");
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:...