refactor 576

fishercoder1534 · fishercoder1534 · commit cd28e80f3450 · 2019-07-13T07:47:17.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_576.java b/src/main/java/com/fishercoder/solutions/_576.java
@@ -29,36 +29,39 @@
 
  */
 public class _576 {
-
-    /**reference: https://leetcode.com/articles/out-of-boundary-paths/#approach-2-recursion-with-memoization-accepted*/
-    public int findPaths(int m, int n, int N, int x, int y) {
-        int M = 1000000000 + 7;
-        int[][] dp = new int[m][n];
-        dp[x][y] = 1;
-        int count = 0;
-        for (int moves = 1; moves <= N; moves++) {
-            int[][] temp = new int[m][n];
-            for (int i = 0; i < m; i++) {
-                for (int j = 0; j < n; j++) {
-                    if (i == m - 1) {
-                        count = (count + dp[i][j]) % M;
-                    }
-                    if (j == n - 1) {
-                        count = (count + dp[i][j]) % M;
-                    }
-                    if (i == 0) {
-                        count = (count + dp[i][j]) % M;
-                    }
-                    if (j == 0) {
-                        count = (count + dp[i][j]) % M;
+    public static class Solution1 {
+        /**
+         * reference: https://leetcode.com/articles/out-of-boundary-paths/#approach-2-recursion-with-memoization-accepted
+         */
+        public int findPaths(int m, int n, int N, int x, int y) {
+            int M = 1000000000 + 7;
+            int[][] dp = new int[m][n];
+            dp[x][y] = 1;
+            int count = 0;
+            for (int moves = 1; moves <= N; moves++) {
+                int[][] temp = new int[m][n];
+                for (int i = 0; i < m; i++) {
+                    for (int j = 0; j < n; j++) {
+                        if (i == m - 1) {
+                            count = (count + dp[i][j]) % M;
+                        }
+                        if (j == n - 1) {
+                            count = (count + dp[i][j]) % M;
+                        }
+                        if (i == 0) {
+                            count = (count + dp[i][j]) % M;
+                        }
+                        if (j == 0) {
+                            count = (count + dp[i][j]) % M;
+                        }
+                        temp[i][j] = (((i > 0 ? dp[i - 1][j] : 0) + (i < m - 1 ? dp[i + 1][j] : 0)) % M
+                                + ((j > 0 ? dp[i][j - 1] : 0) + (j < n - 1 ? dp[i][j + 1] : 0)) % M) % M;
                     }
-                    temp[i][j] = (((i > 0 ? dp[i - 1][j] : 0) + (i < m - 1 ? dp[i + 1][j] : 0)) % M
-                           + ((j > 0 ? dp[i][j - 1] : 0) + (j < n - 1 ? dp[i][j + 1] : 0)) % M) % M;
                 }
+                dp = temp;
             }
-            dp = temp;
+            return count;
         }
-        return count;
     }
 
 }
