update: 添加问题“790.多米诺和托米诺平铺”的代码和题解(#918)

* clean: #915

Signed-off-by: LetMeFly666 <[email protected]>

* archive: clean+todo

Signed-off-by: LetMeFly666 <[email protected]>

* notes: learn ai with shy

Signed-off-by: LetMeFly666 <[email protected]>

* refactor: rename

https://github.com/LetMeFly666/LeetCode/pull/913\#discussion_r2072556534
Signed-off-by: LetMeFly666 <[email protected]>

* words: en+jp

Signed-off-by: LetMeFly666 <[email protected]>

* feat: newSolution.py同时生成源码

close #916

Signed-off-by: LetMeFly666 <[email protected]>

* update: 添加问题“790.多米诺和托米诺平铺”的代码和题解(#918)
生成模板
close #916
close #912

Signed-off-by: LetMeFly666 <[email protected]>

---------

Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

.changelog

@@ -0,0 +1,3 @@
+生成模板
+close #916
+close #912

.commitmsg

@@ -0,0 +1,51 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-05 21:58:06
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-05 22:23:11
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+#ifdef FirstTry  // Error
+const int MOD = 1e9 + 7;
+
+class Solution {
+public:
+    int numTilings(int n) {
+        vector<int> dp(n + 1);
+        dp[0] = 1;
+        for (int i = 1; i <= n; i++) {
+            dp[i] = (dp[i] + dp[i - 1]) % MOD;
+            if (i >= 2) {
+                dp[i] = (dp[i] + dp[i - 2]) % MOD;
+            }
+            if (i >= 3) {
+                dp[i] = (dp[i] + dp[i - 3]) % MOD;
+                dp[i] = (dp[i] + dp[i - 3]) % MOD;
+            }
+        }
+        return dp.back();
+    }
+};
+#else  // FirstTry
+// SecondTry
+const int MOD = 1e9 + 7;
+
+class Solution {
+public:
+    int numTilings(int n) {
+        if (n == 1) {
+            return 1;
+        }
+        vector<int> dp(n + 1);
+        dp[0] = dp[1] = 1;
+        dp[2] = 2;
+        for (int i = 3; i <= n; i++) {
+            dp[i] = ((dp[i - 1] * 2) % MOD + dp[i - 3]) % MOD;
+        }
+        return dp.back();
+    }
+};
+#endif  // FirstTry

AllProblems/_getResult.json

@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-05 21:58:06
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-05 22:38:29
+ */
+package main
+
+var MOD int = 1000000007
+
+func numTilings(n int) int {
+    if n == 1 {
+        return 1
+    }
+    dp := make([]int, n + 1)
+    dp[0] = 1
+    dp[1] = 1
+    dp[2] = 2
+    for i := 3; i <= n; i++ {
+        dp[i] = (dp[i - 1] * 2 % MOD + dp[i - 3]) % MOD
+    }
+    return dp[n]
+}

AllProblems/_getResult.txt

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-05 21:58:06
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-05 22:28:23
+ */
+class Solution {
+    private static int MOD = 1000000007;
+
+    public int numTilings(int n) {
+        if (n == 1) {
+            return 1;
+        }
+        int[] dp = new int[n + 1];
+        dp[0] = dp[1] = 1;
+        dp[2] = 2;
+        for (int i = 3; i <= n; i++) {
+            dp[i] = ((dp[i - 1] * 2) % MOD + dp[i - 3]) % MOD;
+        }
+        return dp[n];
+    }
+}

AllProblems/_gitResult.txt

@@ -0,0 +1,18 @@
+'''
+Author: LetMeFly
+Date: 2025-05-05 21:58:06
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-05-05 22:25:56
+'''
+MOD = 1000000007
+
+class Solution:
+    def numTilings(self, n: int) -> int:
+        if n == 1:
+            return 1
+        dp = [0] * (n + 1)
+        dp[0] = dp[1] = 1
+        dp[2] = 2
+        for i in range(3, n + 1):
+            dp[i] = (dp[i - 1] * 2 + dp[i - 3]) % MOD
+        return dp[-1]