Merge pull request #645 from LetMeFly666/935

problem.935

Author: LetMeFly666

Codes/0935-knight-dialer.cpp

@@ -0,0 +1,46 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-12-10 14:52:45
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2024-12-10 15:08:24
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+const vector<vector<int>> canFrom = {
+    {4, 6},  // 0可以来自4，6
+    {6, 8},
+    {7, 9},
+    {4, 8},
+    {3, 9, 0},
+    {},
+    {1, 7, 0},
+    {2, 6},
+    {1, 3},
+    {2, 4}
+};
+const int mod = 1e9 + 7;
+
+class Solution {
+public:
+    int knightDialer(int n) {
+        int last[10], now[10];
+        fill(last, last + 10, 1);
+        for (int i = 2; i <= n; i++) {
+            memset(now, 0, sizeof(now));
+            for (int j = 0; j < 10; j++) {
+                for (int from : canFrom[j]) {
+                    now[j] = (now[j] + last[from]) % mod;
+                }
+            }
+            memcpy(last, now, sizeof(now));
+        }
+        // return accumulate(last, last + 10, 0);  // WA，这里没取模
+        int ans = 0;
+        for (int i = 0; i < 10; i++) {
+            ans = (ans + last[i]) % mod;
+        }
+        return ans;
+    }
+};

Codes/0935-knight-dialer.go

@@ -0,0 +1,41 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-12-10 15:29:56
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2024-12-10 15:39:22
+ */
+package main
+
+var canFrom = [][]int{
+    {4, 6},  // 0可以来自4，6
+    {6, 8},
+    {7, 9},
+    {4, 8},
+    {3, 9, 0},
+    {},
+    {1, 7, 0},
+    {2, 6},
+    {1, 3},
+    {2, 4},
+};
+var mod = 1000000007
+
+func knightDialer(n int) (ans int) {
+    last := make([]int, 10)
+    for i := range last {
+        last[i] = 1
+    }
+    for i := 2; i <= n; i++ {
+        now := make([]int, 10)
+        for j := 0; j < 10; j++ {
+            for _, from := range canFrom[j] {
+                now[j] = (now[j] + last[from]) % mod
+            }
+        }
+        last = now
+    }
+    for i := range last {
+        ans = (ans + last[i]) % mod;
+    }
+    return
+}

Codes/0935-knight-dialer.java

@@ -0,0 +1,42 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-12-10 15:17:45
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2024-12-10 15:29:23
+ */
+import java.util.Arrays;
+
+class Solution {
+    private final int[][] canFrom = {
+        {4, 6},  // 0可以来自4，6
+        {6, 8},
+        {7, 9},
+        {4, 8},
+        {3, 9, 0},
+        {},
+        {1, 7, 0},
+        {2, 6},
+        {1, 3},
+        {2, 4}
+    };
+    private final int mod = 1000000007;
+
+    public int knightDialer(int n) {
+        int[] last = new int[10];
+        int[] now = new int[10];
+        Arrays.fill(last, 1);
+        for (int i = 2; i <= n; i++) {
+            for (int j = 0; j < 10; j++) {
+                for (int from : canFrom[j]) {
+                    now[j] = (now[j] + last[from]) % mod;
+                }
+            }
+            last = now;
+        }
+        int ans = 0;
+        for (int i = 0; i < 10; i++) {
+            ans = (ans + last[i]) % mod;
+        }
+        return ans;
+    }
+}

Codes/0935-knight-dialer.py

@@ -0,0 +1,31 @@
+'''
+Author: LetMeFly
+Date: 2024-12-10 15:14:37
+LastEditors: LetMeFly.xyz
+LastEditTime: 2024-12-10 15:17:05
+'''
+# AC,57.50%,56.76%
+CAN_FROM = [
+    [4, 6],
+    [6, 8],
+    [7, 9],
+    [4, 8],
+    [3, 9, 0],
+    [], 
+    [1, 7, 0],
+    [2, 6],
+    [1, 3],
+    [2, 4]
+]
+MOD = 1_000_000_007
+
+class Solution:
+    def knightDialer(self, n: int) -> int:
+        last = [1] * 10
+        for _ in range(n - 1):
+            now = [0] * 10
+            for i in range(10):
+                for j in CAN_FROM[i]:
+                    now[i] = (now[i] + last[j]) % MOD
+            last = now
+        return sum(last) % MOD

README.md

@@ -309,6 +309,7 @@
 |0927.三等分|困难|<a href="https://leetcode.cn/problems/three-equal-parts/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/10/06/LeetCode%200927.%E4%B8%89%E7%AD%89%E5%88%86/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127189062" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/three-equal-parts/solution/letmefly-927san-deng-fen-by-tisfy-88qx/" target="_blank">LeetCode题解</a>|
 |0931.下降路径最小和|中等|<a href="https://leetcode.cn/problems/minimum-falling-path-sum/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/07/13/LeetCode%200931.%E4%B8%8B%E9%99%8D%E8%B7%AF%E5%BE%84%E6%9C%80%E5%B0%8F%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131694030" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-falling-path-sum/solutions/2341854/letmefly-931xia-jiang-lu-jing-zui-xiao-h-ier1/" target="_blank">LeetCode题解</a>|
 |0934.最短的桥|中等|<a href="https://leetcode.cn/problems/shortest-bridge/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/10/25/LeetCode%200934.%E6%9C%80%E7%9F%AD%E7%9A%84%E6%A1%A5/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127509391" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/shortest-bridge/solution/letmefly-934zui-duan-de-qiao-by-tisfy-dtew/" target="_blank">LeetCode题解</a>|
+|0935.骑士拨号器|中等|<a href="https://leetcode.cn/problems/knight-dialer/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/10/LeetCode%200935.%E9%AA%91%E5%A3%AB%E6%8B%A8%E5%8F%B7%E5%99%A8/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144375933" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/knight-dialer/solutions/3016246/letmefly-935qi-shi-bo-hao-qi-dong-tai-gu-bwmn/" target="_blank">LeetCode题解</a>|
 |0938.二叉搜索树的范围和|简单|<a href="https://leetcode.cn/problems/range-sum-of-bst/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/02/26/LeetCode%200938.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E8%8C%83%E5%9B%B4%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/136306565" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/range-sum-of-bst/solutions/2654910/letmefly-938er-cha-sou-suo-shu-de-fan-we-fj3h/" target="_blank">LeetCode题解</a>|
 |0946.验证栈序列|中等|<a href="https://leetcode.cn/problems/validate-stack-sequences/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/31/LeetCode%200946.%E9%AA%8C%E8%AF%81%E6%A0%88%E5%BA%8F%E5%88%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126616819" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/validate-stack-sequences/solution/letmefly-946yan-zheng-zhan-xu-lie-by-tis-st5n/" target="_blank">LeetCode题解</a>|
 |0952.按公因数计算最大组件大小|困难|<a href="https://leetcode.cn/problems/largest-component-size-by-common-factor/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/30/LeetCode%200952.%E6%8C%89%E5%85%AC%E5%9B%A0%E6%95%B0%E8%AE%A1%E7%AE%97%E6%9C%80%E5%A4%A7%E7%BB%84%E4%BB%B6%E5%A4%A7%E5%B0%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126069985" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/largest-component-size-by-common-factor/solution/letmefly-952an-gong-yin-shu-ji-suan-zui-4ljri/" target="_blank">LeetCode题解</a>|