day1: Always Day 1

LetMeFly666 · LetMeFly666 · commit 7e67f68d6392 · 2025-04-04T00:12:55.000+08:00
update: 添加问题“2140.解决智力问题”的代码和题解(#855) MGJW: 周报.(本周->上周) Signed-off-by: LetMeFly666 <814114971@qq.com>
diff --git a/Codes/2140-solving-questions-with-brainpower_DFS.cpp b/Codes/2140-solving-questions-with-brainpower_DFS.cpp
@@ -0,0 +1,32 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-03 23:18:15
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-03 23:24:41
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+
+class Solution {
+private:
+    vector<vector<int>> q;
+    unordered_map<int, ll> cache;
+
+    ll dfs(int n) {
+        if (n >= q.size()) {
+            return 0;
+        }
+        if (cache.count(n)) {
+            return cache[n];
+        }
+        return cache[n] = max(dfs(n + 1), dfs(n + q[n][1] + 1) + q[n][0]);
+    }
+public:
+    ll mostPoints(vector<vector<int>>& questions) {
+        q = move(questions);
+        return dfs(0);
+    }
+};
diff --git a/Codes/2140-solving-questions-with-brainpower_DFS.go b/Codes/2140-solving-questions-with-brainpower_DFS.go
@@ -0,0 +1,29 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-03 23:39:08
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-03 23:46:51
+ */
+package main
+
+var q [][]int
+// var cache = make(map[int]int64)  // 不可！会被力扣多次调用
+var cache map[int]int64  // 这里声明即可，每次在mostPoints时重新赋值
+
+func dfs2140(i int) int64 {
+    if i >= len(q) {
+        return 0
+    }
+    if val, ok := cache[i]; ok {
+        return val
+    }
+    ans := max(dfs2140(i + 1), dfs2140(i + q[i][1] + 1) + int64(q[i][0]))
+    cache[i] = ans
+    return ans
+}
+
+func mostPoints(questions [][]int) int64 {
+    q = questions
+    cache = make(map[int]int64)
+    return dfs2140(0)
+}
diff --git a/Codes/2140-solving-questions-with-brainpower_DFS.java b/Codes/2140-solving-questions-with-brainpower_DFS.java
@@ -0,0 +1,30 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-03 23:32:21
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-03 23:38:01
+ */
+import java.util.Map;
+import java.util.HashMap;
+
+class Solution {
+    private int[][] q;
+    private Map<Integer, Long> cache = new HashMap<>();
+
+    private long dfs(int i) {
+        if (i >= q.length) {
+            return 0;
+        }
+        if (cache.containsKey(i)) {
+            return cache.get(i);
+        }
+        long ans = Math.max(dfs(i + 1), dfs(i + q[i][1] + 1) + q[i][0]);
+        cache.put(i, ans);
+        return ans;
+    }
+
+    public long mostPoints(int[][] questions) {
+        q = questions;
+        return dfs(0);
+    }
+}
diff --git a/Codes/2140-solving-questions-with-brainpower_DFS.py b/Codes/2140-solving-questions-with-brainpower_DFS.py
@@ -0,0 +1,20 @@
+'''
+Author: LetMeFly
+Date: 2025-04-03 23:28:40
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-04-03 23:31:54
+'''
+from functools import cache
+from typing import List
+
+
+class Solution:
+    @cache
+    def dfs(self, i: int) -> int:
+        if i >= len(self.q):
+            return 0
+        return max(self.dfs(i + 1), self.dfs(i + self.q[i][1] + 1) + self.q[i][0])
+
+    def mostPoints(self, questions: List[List[int]]) -> int:
+        self.q = questions
+        return self.dfs(0)
diff --git a/Codes/2140-solving-questions-with-brainpower_DP.go b/Codes/2140-solving-questions-with-brainpower_DP.go
@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-03 23:53:40
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-03 23:56:32
+ */
+package main
+
+func mostPoints(questions [][]int) int64 {
+    n := len(questions)
+    dp := make([]int64, n + 1)
+    for i := n - 1; i >= 0; i-- {
+        j := min(i + questions[i][1] + 1, n)
+        dp[i] = max(dp[i + 1], dp[j] + int64(questions[i][0]))
+    }
+    return dp[0]
+}
diff --git a/Codes/2140-solving-questions-with-brainpower_DP.java b/Codes/2140-solving-questions-with-brainpower_DP.java
@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-03 23:50:36
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-03 23:52:09
+ */
+class Solution {
+    public long mostPoints(int[][] questions) {
+        int n = questions.length;
+        long[] dp = new long[n + 1];
+        for (int i = n - 1; i >= 0; i--) {
+            int j = Math.min(i + questions[i][1] + 1, n);
+            dp[i] = Math.max(dp[i + 1], dp[j] + questions[i][0]);
+        }
+        return dp[0];
+    }
+}
diff --git a/Codes/2140-solving-questions-with-brainpower_DP.py b/Codes/2140-solving-questions-with-brainpower_DP.py
@@ -0,0 +1,16 @@
+'''
+Author: LetMeFly
+Date: 2025-04-03 23:48:00
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-04-03 23:49:25
+'''
+from typing import List
+
+class Solution:
+    def mostPoints(self, questions: List[List[int]]) -> int:
+        n = len(questions)
+        dp = [0] * (n + 1)
+        for i in range(n - 1, -1, -1):
+            j = min(i + questions[i][1] + 1, n)
+            dp[i] = max(dp[i + 1], dp[j] + questions[i][0])
+        return dp[0]
diff --git a/Codes/2140-solving-questions-with-brainpower_WA+DP.cpp b/Codes/2140-solving-questions-with-brainpower_WA+DP.cpp
@@ -0,0 +1,53 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-03 22:29:08
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-03 23:01:43
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+
+#ifdef FirstTry  // WA  // 不可：将当前经验值直接累加到后面
+/*
+ [[1,1],[2,2],[3,3],[4,4],[5,5]]
+cnt 0    0      1      1    1+2
+dp  1    2      4      5     8
+
+real ans: 7
+*/
+typedef long long ll;
+
+class Solution {
+public:
+    ll mostPoints(vector<vector<int>>& questions) {
+        vector<ll> dp(questions.size());
+        ll cnt = 0;
+        for (int i = 0; i < questions.size(); i++) {
+            cnt += dp[i];
+            dp[i] = cnt + questions[i][0];
+            if (i + questions[i][1] + 1 < questions.size()) {
+                dp[i + questions[i][1] + 1] += questions[i][0];
+            }
+        }
+        return dp.back();
+    }
+};
+#else  // FirstTry
+// SecondTry
+typedef long long ll;
+
+class Solution {
+public:
+    ll mostPoints(vector<vector<int>>& questions) {
+        int n = questions.size();
+        vector<ll> dp(n + 1);
+        for (int i = n - 1; i >= 0; i--) {
+            int j = min(i + questions[i][1] + 1, n);
+            dp[i] = max(dp[i + 1], dp[j] + questions[i][0]);
+        }
+        return dp[0];
+    }
+};
+#endif  // FirstTry
diff --git a/README.md b/README.md
@@ -664,6 +664,7 @@
 |2116.判断一个括号字符串是否有效|中等|<a href="https://leetcode.cn/problems/check-if-a-parentheses-string-can-be-valid/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/23/LeetCode%202116.%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E6%8B%AC%E5%8F%B7%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E6%9C%89%E6%95%88/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146454056" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/check-if-a-parentheses-string-can-be-valid/solutions/3624225/letmefly-2116pan-duan-yi-ge-gua-hao-zi-f-9n2z/" target="_blank">LeetCode题解</a>|
 |2129.将标题首字母大写|简单|<a href="https://leetcode.cn/problems/capitalize-the-title/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/03/11/LeetCode%202129.%E5%B0%86%E6%A0%87%E9%A2%98%E9%A6%96%E5%AD%97%E6%AF%8D%E5%A4%A7%E5%86%99/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/136614914" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/capitalize-the-title/solutions/2679708/letmefly-2129jiang-biao-ti-shou-zi-mu-da-nj90/" target="_blank">LeetCode题解</a>|
 |2132.用邮票贴满网格图|困难|<a href="https://leetcode.cn/problems/stamping-the-grid/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/12/14/LeetCode%202132.%E7%94%A8%E9%82%AE%E7%A5%A8%E8%B4%B4%E6%BB%A1%E7%BD%91%E6%A0%BC%E5%9B%BE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/135002925" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/stamping-the-grid/solutions/2566644/letmefly-2132yong-you-piao-tie-man-wang-znigh/" target="_blank">LeetCode题解</a>|
+|2140.解决智力问题|中等|<a href="https://leetcode.cn/problems/solving-questions-with-brainpower/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/03/LeetCode%202140.%E8%A7%A3%E5%86%B3%E6%99%BA%E5%8A%9B%E9%97%AE%E9%A2%98/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146991317" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/solving-questions-with-brainpower/solutions/3639601/letmefly-2140jie-jue-zhi-li-wen-ti-ji-yi-pxc4/" target="_blank">LeetCode题解</a>|
 |2171.拿出最少数目的魔法豆|中等|<a href="https://leetcode.cn/problems/removing-minimum-number-of-magic-beans/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/01/18/LeetCode%202171.%E6%8B%BF%E5%87%BA%E6%9C%80%E5%B0%91%E6%95%B0%E7%9B%AE%E7%9A%84%E9%AD%94%E6%B3%95%E8%B1%86/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/135682601" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/removing-minimum-number-of-magic-beans/solutions/2609831/letmefly-2171na-chu-zui-shao-shu-mu-de-m-jima/" target="_blank">LeetCode题解</a>|
 |2178.拆分成最多数目的正偶数之和|中等|<a href="https://leetcode.cn/problems/maximum-split-of-positive-even-integers/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/07/06/LeetCode%202178.%E6%8B%86%E5%88%86%E6%88%90%E6%9C%80%E5%A4%9A%E6%95%B0%E7%9B%AE%E7%9A%84%E6%AD%A3%E5%81%B6%E6%95%B0%E4%B9%8B%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131567568" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-split-of-positive-even-integers/solutions/2332513/letmefly-2178chai-fen-cheng-zui-duo-shu-m44er/" target="_blank">LeetCode题解</a>|
 |2180.统计各位数字之和为偶数的整数个数|简单|<a href="https://leetcode.cn/problems/count-integers-with-even-digit-sum/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/01/06/LeetCode%202180.%E7%BB%9F%E8%AE%A1%E5%90%84%E4%BD%8D%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E6%95%B4%E6%95%B0%E4%B8%AA%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/128583772" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-integers-with-even-digit-sum/solutions/2048274/letmefly-2180tong-ji-ge-wei-shu-zi-zhi-h-g2ib/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 2140.解决智力问题.md b/Solutions/LeetCode 2140.解决智力问题.md
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
diff --git a/newSolution.py b/newSolution.py
diff --git a/toSay.md b/toSay.md
