220523

Author: aluferraz

src/Main.java

@@ -1,6 +1,7 @@
 import leetcode.editor.en.Q1035.UncrossedLines;
 import leetcode.editor.en.Q1220.CountVowelsPermutation;
 import leetcode.editor.en.Q1259.HandshakesThatDontCross;
+import leetcode.editor.en.Q1473.PaintHouseIii;
 import leetcode.editor.en.Q1498.NumberOfSubsequencesThatSatisfyTheGivenSumCondition;
 import leetcode.editor.en.Q1697.CheckingExistenceOfEdgeLengthLimitedPaths;
 import leetcode.editor.en.Q1721.SwappingNodesInALinkedList;
@@ -14,6 +15,7 @@
 import leetcode.editor.en.Q376.WiggleSubsequence;
 import leetcode.editor.en.Q377.CombinationSumIv;
 import leetcode.editor.en.Q399.EvaluateDivision;
+import leetcode.editor.en.Q403.FrogJump;
 import leetcode.editor.en.Q474.OnesAndZeroes;
 import leetcode.editor.en.Q518.CoinChangeII;
 import leetcode.editor.en.Q54.SpiralMatrix;
@@ -37,7 +39,7 @@
 public class Main {
     public static void main(String[] args) throws IOException {
 
-        System.out.println(new ShortestBridge().shortestBridge(toIntMatrix("[[0,1],[1,0]]")));
+        System.out.println(new FrogJump().canCross(toIntArray("[0,1,3,6,10,15,19,21,24,26,30,33]\n")));
 
     }
 

src/leetcode/editor/en/Q1473/PaintHouseIii.java

@@ -0,0 +1,54 @@
+package leetcode.editor.en.Q1473;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+
+    Integer[][][] cache;
+    private int INF = 100000000;
+
+    public int minCost(int[] houses, int[][] cost, int m, int n, int target) {
+        cache = new Integer[m][n + 1][target + 1];
+        int ans = paintHouses(0, houses, cost, m, n, target, -1);
+        if (ans >= INF) return -1;
+        return ans;
+    }
+
+
+    private int paintHouses(int i, int[] houses, int[][] costs, int m, int n, int target, int prev) {
+        if (i == m) {
+            if (target == 0) return 0;
+            return INF;
+        }
+        if (target < 0) return INF;
+
+        if (prev != -1 && cache[i][prev][target] != null) {
+            return cache[i][prev][target];
+        }
+        int ans = INF;
+        int neighborhood = (prev != houses[i] ? 1 : 0);
+        if (houses[i] != 0) {
+            ans = paintHouses(i + 1, houses, costs, m, n, target - neighborhood, houses[i]);
+        } else {
+            for (int color = 1; color <= n; color++) {
+                int cost = costs[i][color - 1];
+                neighborhood = (i == 0 || prev != color ? 1 : 0);
+                int costOfPainting = cost + paintHouses(i + 1, houses, costs, m, n, target - neighborhood, color);
+                ans = Math.min(ans, costOfPainting);
+            }
+
+        }
+        if (prev != -1) cache[i][prev][target] = ans;
+        return ans;
+    }
+
+
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class PaintHouseIii extends Solution {
+}

src/leetcode/editor/en/Q403/FrogJump.java

@@ -0,0 +1,55 @@
+package leetcode.editor.en.Q403;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+
+    HashMap<Pair<Integer, Integer>, Boolean> cache = new HashMap<>();
+
+    public boolean canCross(int[] stones) {
+        LinkedHashSet<Integer> stonesSet = new LinkedHashSet<>();
+        for (int stone : stones) {
+            stonesSet.add(stone);
+        }
+        return canCrossHelper(0, 1, stonesSet, stones[stones.length - 1]);
+    }
+
+    public boolean canCrossHelper(int i, int k, LinkedHashSet<Integer> stones, int target) {
+        if (i == target) return true;
+        if (i + (k - 1) > target) return false;
+
+
+        Pair<Integer, Integer> cacheKey = new Pair<>(i, k);
+        if (cache.containsKey(cacheKey)) {
+            return cache.get(cacheKey);
+        }
+
+        boolean ans = false;
+        if (k - 1 > 0) {
+            if (stones.contains(i + (k - 1))) {
+                ans = canCrossHelper(i + (k - 1), k - 1, stones, target);
+                if (ans) return ans;
+            }
+        }
+        if (stones.contains(i + k)) {
+            ans = canCrossHelper(i + k, (k), stones, target);
+            if (ans) return ans;
+        }
+        if (i > 0 && stones.contains(i + k + 1)) {
+            ans = canCrossHelper(i + k + 1, (k + 1), stones, target);
+            if (ans) return ans;
+        }
+
+        cache.put(cacheKey, ans);
+        return ans;
+
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class FrogJump extends Solution {
+}