576

Author: rising0raj

576. Out of Boundary Paths.java

@@ -0,0 +1,33 @@
+// Runtime    2ms
+// Beats      100.00%
+
+
+// Memory     42.37MB
+// Beats      49.60%
+
+
+class Solution {
+    Integer[][][] dp;
+    int mod = 1_000_000_000+7;
+    int m, n;
+    public int findPaths(int m, int n, int maxMove, int x, int y) {
+        dp = new Integer[m][n][maxMove+1];
+        this.m=m;
+        this.n=n;
+        return helper(maxMove, x, y);
+    }
+
+    int helper(int maxMove, int x, int y){
+        if(x<0 || x>=m || y<0 || y>=n)return 1;
+        if(maxMove<=0)return 0;
+        if(dp[x][y][maxMove]!=null)return dp[x][y][maxMove];
+        int res=0;
+        res=(res+helper(maxMove-1, x+1, y))%mod;
+        res=(res+helper(maxMove-1, x, y-1))%mod;
+        res=(res+helper(maxMove-1, x-1, y))%mod;
+        res=(res+helper(maxMove-1, x, y+1))%mod;
+        dp[x][y][maxMove]=res;
+        return res;
+
+    }
+}