refactor 568

fishercoder1534 · fishercoder1534 · commit f7294bec9816 · 2019-07-09T07:29:21.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_568.java b/src/main/java/com/fishercoder/solutions/_568.java
@@ -74,31 +74,35 @@ You totally have K weeks (each week has 7 days) to travel.
  */
 public class _568 {
 
-    /**credit: https://leetcode.com/articles/maximum-vacation-days/#approach-2-using-dfs-with-memoization-accepted*/
-    public int maxVacationDays(int[][] flights, int[][] days) {
-        int[][] memo = new int[flights.length][days[0].length];
-        for (int[] l: memo) {
-            Arrays.fill(l, Integer.MIN_VALUE);
+    public static class Solution1 {
+        /**
+         * credit: https://leetcode.com/articles/maximum-vacation-days/#approach-2-using-dfs-with-memoization-accepted
+         */
+        public int maxVacationDays(int[][] flights, int[][] days) {
+            int[][] memo = new int[flights.length][days[0].length];
+            for (int[] l : memo) {
+                Arrays.fill(l, Integer.MIN_VALUE);
+            }
+            return dfs(flights, days, 0, 0, memo);
         }
-        return dfs(flights, days, 0, 0, memo);
-    }
 
-    public int dfs(int[][] flights, int[][] days, int curCity, int weekno, int[][] memo) {
-        if (weekno == days[0].length) {
-            return 0;
-        }
-        if (memo[curCity][weekno] != Integer.MIN_VALUE) {
-            return memo[curCity][weekno];
-        }
-        int maxvac = 0;
-        for (int i = 0; i < flights.length; i++) {
-            if (flights[curCity][i] == 1 || i == curCity) {
-                int vac = days[i][weekno] + dfs(flights, days, i, weekno + 1, memo);
-                maxvac = Math.max(maxvac, vac);
+        public int dfs(int[][] flights, int[][] days, int curCity, int weekno, int[][] memo) {
+            if (weekno == days[0].length) {
+                return 0;
+            }
+            if (memo[curCity][weekno] != Integer.MIN_VALUE) {
+                return memo[curCity][weekno];
+            }
+            int maxvac = 0;
+            for (int i = 0; i < flights.length; i++) {
+                if (flights[curCity][i] == 1 || i == curCity) {
+                    int vac = days[i][weekno] + dfs(flights, days, i, weekno + 1, memo);
+                    maxvac = Math.max(maxvac, vac);
+                }
             }
+            memo[curCity][weekno] = maxvac;
+            return maxvac;
         }
-        memo[curCity][weekno] = maxvac;
-        return maxvac;
     }
 
 }
