090823

Author: aluferraz

src/Main.java

@@ -1,4 +1,5 @@
 import leetcode.editor.en.Q1035.UncrossedLines;
+import leetcode.editor.en.Q1220.CountVowelsPermutation;
 import leetcode.editor.en.Q1498.NumberOfSubsequencesThatSatisfyTheGivenSumCondition;
 import leetcode.editor.en.Q1697.CheckingExistenceOfEdgeLengthLimitedPaths;
 import leetcode.editor.en.Q1752.CheckIfArrayIsSortedAndRotated;
@@ -10,6 +11,7 @@
 import leetcode.editor.en.Q377.CombinationSumIv;
 import leetcode.editor.en.Q474.OnesAndZeroes;
 import leetcode.editor.en.Q518.CoinChangeII;
+import leetcode.editor.en.Q54.SpiralMatrix;
 import leetcode.editor.en.Q649.Dota2Senate;
 import leetcode.editor.en.Q91.DecodeWays;
 import org.json.JSONArray;
@@ -25,7 +27,7 @@
 
 public class Main {
     public static void main(String[] args) throws IOException {
-        System.out.println(Arrays.deepToString(new SparseMatrixMultiplication().multiply(toIntMatrix("[[1,-5]]"), toIntMatrix("[[12],[-1]]"))));
+        System.out.println(new CountVowelsPermutation().countVowelPermutation(2));
 
     }
 

src/leetcode/editor/en/Q1220/CountVowelsPermutation.java

@@ -0,0 +1,65 @@
+package leetcode.editor.en.Q1220;
+
+import java.math.BigInteger;
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+import java.math.BigInteger;
+
+class Solution {
+    BigInteger[][] cache;
+
+    public int countVowelPermutation(int n) {
+        BigInteger ans = new BigInteger("0");
+        cache = new BigInteger[26][n + 1];
+        ans = ans.add(countVowelPermutation('a', n - 1));
+        ans = ans.add(countVowelPermutation('e', n - 1));
+        ans = ans.add(countVowelPermutation('i', n - 1));
+        ans = ans.add(countVowelPermutation('o', n - 1));
+        ans = ans.add(countVowelPermutation('u', n - 1));
+        return ans.mod(new BigInteger("1000000007")).intValue();
+    }
+
+    public BigInteger countVowelPermutation(char c, int n) {
+        if (n == 0) {
+            return new BigInteger("1");
+        }
+        BigInteger ans = new BigInteger("0");
+        if (cache[c - 'a'][n] != null) {
+            return cache[c - 'a'][n];
+        }
+        switch (c) {
+            case 'a' -> {
+                ans = ans.add(countVowelPermutation('e', n - 1));
+            }
+            case 'e' -> {
+                ans = ans.add(countVowelPermutation('a', n - 1));
+                ans = ans.add(countVowelPermutation('i', n - 1));
+            }
+            case 'i' -> {
+                ans = ans.add(countVowelPermutation('a', n - 1));
+                ans = ans.add(countVowelPermutation('e', n - 1));
+                ans = ans.add(countVowelPermutation('o', n - 1));
+                ans = ans.add(countVowelPermutation('u', n - 1));
+            }
+            case 'o' -> {
+                ans = ans.add(countVowelPermutation('i', n - 1));
+                ans = ans.add(countVowelPermutation('u', n - 1));
+            }
+            case 'u' -> {
+                ans = ans.add(countVowelPermutation('a', n - 1));
+            }
+
+        }
+        cache[c - 'a'][n] = ans;
+        return ans;
+
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class CountVowelsPermutation extends Solution {
+}

src/leetcode/editor/en/Q265/PaintHouseIi.java

@@ -0,0 +1,40 @@
+package leetcode.editor.en.Q265;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+
+    Integer[][] cache;
+
+    public int minCostII(int[][] costs) {
+        cache = new Integer[costs.length][costs[0].length + 1];
+        return minCostII(0, costs[0].length, costs);
+    }
+
+    private int minCostII(int i, int cantBe, int[][] costs) {
+        if (i == costs.length) {
+            return 0;
+        }
+        if (cache[i][cantBe] != null) {
+            return cache[i][cantBe];
+        }
+
+        int[] colors = costs[i];
+        int ans = Integer.MAX_VALUE;
+        for (int j = 0; j < colors.length; j++) {
+            if (j == cantBe) continue;
+            int cost = colors[j] + minCostII(i + 1, j, costs);
+            ans = Math.min(ans, cost);
+        }
+        cache[i][cantBe] = ans;
+        return ans;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class PaintHouseIi extends Solution {
+}

src/leetcode/editor/en/Q54/SpiralMatrix.java

@@ -0,0 +1,57 @@
+package leetcode.editor.en.Q54;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    List<Integer> ans;
+    private int[][] DIRECTIONS = new int[][]{
+            new int[]{0, 1}, //right
+            new int[]{1, 0}, //down
+            new int[]{0, -1}, //left
+            new int[]{-1, 0}, //up
+    };
+
+    public List<Integer> spiralOrder(int[][] matrix) {
+        boolean[][] visited = new boolean[matrix.length][matrix[0].length];
+        ans = new ArrayList<>();
+        dfs(0, 0, 0, visited, matrix);
+        return ans;
+    }
+
+    private void dfs(int row, int col, int dir, boolean[][] visited, int[][] matrix) {
+        visited[row][col] = true;
+        ans.add(matrix[row][col]);
+        int[] next = newDir(row, col, dir, visited);
+        if (next[0] == -1) return;
+        dfs(next[0], next[1], next[2], visited, matrix);
+    }
+
+    private int[] newDir(int row, int col, int dir, boolean[][] visited) {
+        int newRow = row + DIRECTIONS[dir][0];
+        int newCol = col + DIRECTIONS[dir][1];
+        if (isValidIdx(newRow, newCol, visited)) {
+            return new int[]{newRow, newCol, dir};
+        } else {
+            dir = ((dir + 1) % DIRECTIONS.length);
+            newRow = row + DIRECTIONS[dir][0];
+            newCol = col + DIRECTIONS[dir][1];
+            if (isValidIdx(newRow, newCol, visited)) {
+                return new int[]{newRow, newCol, dir};
+            }
+        }
+        return new int[]{-1, -1, -1};
+    }
+
+    private boolean isValidIdx(int row, int col, boolean[][] visited) {
+        return row >= 0 && row < visited.length && col >= 0 && col < visited[row].length && !visited[row][col];
+    }
+
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class SpiralMatrix extends Solution {
+}