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;
}
}
Saturday, January 29, 2022
Get Maze Path
Subscribe to:
Post Comments (Atom)
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:...
-
https://leetcode.com/problems/reverse-integer/description/ Integer.MAX_VALUE = 2,147,483,647 = 2 31 - 1 Integer.MIN_VALUE = -2,147,483,64...
-
https://leetcode.com/problems/two-sum/description/ Given the constraints: 2 <= nums.length <= 10⁴ -10⁹ <= nums[i] <= 10⁹ -10...
-
For this particular question, we only have the In - region. So, the code looks like : package pep.Day7 ; public class TowerOfHanoi { p...
No comments:
Post a Comment