update: 添加问题“2999.统计强大整数的数目”的代码和题解(#870)

LetMeFly666 · web-flow · commit 4e61e603ff2c · 2025-04-13T14:41:31.000+08:00
* 2999: WA.py (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: WA.py - all 0(#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: AC.py - fix.(high.(0->9)+min(high, limit))(#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: WA.cpp (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: TLE.cpp | fix.(char->int) (#869) accepted https://github.com/LetMeFly666/LeetCode/pull/863\#pullrequestreview-2760402878 at last commit b8188e8 Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: WA.cpp | fix.cache (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: WA.cpp | fix.cache (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * vscode: auto generated settings (#869) 刚在聊天 Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: WA.cpp | 对拍 (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: AC.cpp | cache.(int->ll) (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: CE.java (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: WA.java (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: AC.java | AC,70.30%,86.73% | fix.(i++->d++|this.limit=limit) (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: WA.go (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: AC.go - AC,100.00%,8.71% (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: 题解half版本 (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2999: 题解就是为了重新解释这句话 (#869) Signed-off-by: LetMeFly666 <814114971@qq.com> * update: 添加问题“2999.统计强大整数的数目”的代码和题解(#870) Signed-off-by: LetMeFly666 <814114971@qq.com> --------- Signed-off-by: LetMeFly666 <814114971@qq.com>
diff --git a/.vscode/settings.json b/.vscode/settings.json
@@ -3,6 +3,7 @@
         "*.pro": "plaintext",
         "*.wxss": "css",
         "*.wxml": "html",
+        ".commitmsg": "git-commit",
         "array": "cpp",
         "atomic": "cpp",
         "*.tcc": "cpp",
@@ -84,7 +85,11 @@
         "memory": "cpp",
         "memory_resource": "cpp",
         "set": "cpp",
-        "math.h": "c"
+        "math.h": "c",
+        "__hash_table": "cpp",
+        "__split_buffer": "cpp",
+        "__tree": "cpp",
+        "queue": "cpp"
     },
     "editor.mouseWheelZoom": true,
     "workbench.tree.enableStickyScroll": true,
diff --git a/Codes/2999-count-the-number-of-powerful-integers_20250412.py b/Codes/2999-count-the-number-of-powerful-integers_20250412.py
@@ -0,0 +1,33 @@
+'''
+Author: LetMeFly
+Date: 2025-04-12 22:20:48
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-04-12 22:37:40
+'''
+from functools import cache
+
+class Solution:
+    @cache
+    def dfs(self, n: int, limitLow: bool, limitHigh: bool) -> int:
+        if n == self.n:
+            return 1
+        low = self.start[n] if limitLow else 0
+        high = self.finish[n] if limitHigh else 9
+        ans = 0
+        if n < self.free:  # 什么都可以
+            for d in range(low, min(high, self.limit) + 1):
+                ans += self.dfs(n + 1, limitLow and d == low, limitHigh and d == high)
+        else:
+            x = self.s[n - self.free]
+            if low <= x <= high:
+                ans = self.dfs(n + 1, limitLow and x == low, limitHigh and x == high)
+        return ans
+        
+    def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:
+        self.finish = list(map(int, str(finish)))
+        self.n = len(self.finish)
+        self.start = list(map(int, str(start).zfill(self.n)))
+        self.limit = limit
+        self.free = self.n - len(s)
+        self.s = list(map(int, s))
+        return self.dfs(0, True, True)
diff --git a/Codes/2999-count-the-number-of-powerful-integers_20250413.cpp b/Codes/2999-count-the-number-of-powerful-integers_20250413.cpp
@@ -0,0 +1,56 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-13 11:03:19
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-13 11:56:04
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+
+class Solution {
+private:
+    int limit, n, nonFixed;
+    string suffix, start, finish;
+    unordered_map<int, ll> cache;
+
+    ll dfs(int i, bool limitLow, bool limitHigh) {
+        if (i == n) {
+            return 1;
+        }
+        if (!limitLow && !limitHigh && cache.count(i)) {
+            return cache[i];
+        }
+        int low = limitLow ? start[i] - '0' : 0;
+        int high = limitHigh ? finish[i] - '0' : 9;
+        ll ans = 0;
+        if (i < nonFixed) {
+            for (int d = low; d <= min(high, limit); d++) {
+                ans += dfs(i + 1, limitLow && d == low, limitHigh && d == high);
+            }
+        } else {
+            int x = suffix[i - nonFixed] - '0';
+            if (low <= x && x <= high) {  // 题目限制一定小于limit
+                ans = dfs(i + 1, limitLow && x == low, limitHigh && x == high);
+            }
+        }
+        if (!limitLow && !limitHigh) {
+            cache[i] = ans;
+        }
+        return ans;
+    }
+public:
+    long long numberOfPowerfulInt(long long start, long long finish, int limit, string s) {
+        this->limit = limit;
+        suffix = move(s);
+        this->finish = to_string(finish);
+        n = this->finish.size();
+        this->start = to_string(start);
+        this->start = string(n - this->start.size(), '0') + this->start;
+        nonFixed = n - this->suffix.size();
+
+        return dfs(0, true, true);
+    }
+};
diff --git a/Codes/2999-count-the-number-of-powerful-integers_20250413.go b/Codes/2999-count-the-number-of-powerful-integers_20250413.go
@@ -0,0 +1,59 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-13 13:38:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-13 14:00:33
+ */
+package main
+
+import (
+    "strconv"
+    "strings"
+)
+
+func dfs2999(i int, limitLow, limitHigh bool, start, finish string, nonFixed int, cache []int64, limit int, suffix string) (ans int64) {
+    if i == len(start) {
+        return 1
+    }
+    if !limitLow && !limitHigh && cache[i] != -1 {
+        return cache[i]
+    }
+
+    var low, high int
+    if limitLow {
+        low = int(start[i]) - int('0')
+    } else {
+        low = 0
+    }
+    if limitHigh {
+        high = int(finish[i]) - int('0')
+    } else {
+        high = 9
+    }
+    if i < nonFixed {
+        for d := low; d <= min(high, limit); d++ {
+            ans += dfs2999(i + 1, limitLow && d == low, limitHigh && d == high, start, finish, nonFixed, cache, limit, suffix)
+        }
+    } else {
+        d := int(suffix[i - nonFixed]) - int('0')
+        if low <= d && d <= high {
+            ans = dfs2999(i + 1, limitLow && d == low, limitHigh && d == high, start, finish, nonFixed, cache, limit, suffix)
+        }
+    }
+    if !limitLow && !limitHigh {
+        cache[i] = ans
+    }
+    return ans
+}
+
+func numberOfPowerfulInt(start int64, finish int64, limit int, s string) int64 {
+    finish_str := strconv.FormatInt(finish, 10)
+    cache := make([]int64, len(finish_str) + 1)
+    for i := range cache {
+        cache[i] = -1
+    }
+    start_str := strconv.FormatInt(start, 10)
+    start_str = strings.Repeat("0", len(finish_str) - len(start_str)) + start_str
+    nonFixed := len(finish_str) - len(s)
+    return dfs2999(0, true, true, start_str, finish_str, nonFixed, cache, limit, s)
+}
diff --git a/Codes/2999-count-the-number-of-powerful-integers_20250413.java b/Codes/2999-count-the-number-of-powerful-integers_20250413.java
@@ -0,0 +1,53 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-13 13:00:58
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-13 13:37:04
+ * @Description: AC,70.30%,86.73%
+ */
+import java.util.Arrays;
+
+class Solution {
+    private int n, nonFixed, limit;
+    private String start, finish, suffix;
+    private long[] cache;
+
+    private long dfs(int i, boolean limitLow, boolean limitHigh) {
+        if (i == n) {
+            return 1;
+        }
+        if (!limitLow && !limitHigh && cache[i] != -1) {
+            return cache[i];
+        }
+        int low = limitLow ? start.charAt(i) - '0' : 0;
+        int high = limitHigh ? finish.charAt(i) - '0' : 9;
+        long ans = 0;
+        if (i < nonFixed) {
+            for (int d = low; d <= Math.min(limit, high); d++) {
+                ans += dfs(i + 1, limitLow && d == low, limitHigh && d == high);
+            }
+        } else {
+            int x = suffix.charAt(i - nonFixed) - '0';
+            if (low <= x && x <= high) {
+                ans = dfs(i + 1, limitLow && x == low, limitHigh && x == high);
+            }
+        }
+        if (!limitLow && !limitHigh) {
+            cache[i] = ans;
+        }
+        return ans;
+    }
+    
+    public long numberOfPowerfulInt(long start, long finish, int limit, String s) {
+        this.finish = String.valueOf(finish);
+        n = this.finish.length();
+        this.start = String.valueOf(start);
+        this.start = "0".repeat(n - this.start.length()) + this.start;
+        this.limit = limit;
+        nonFixed = n - s.length();
+        cache = new long[n];
+        Arrays.fill(cache, -1);
+        suffix = s;
+        return dfs(0, true, true);
+    }
+}
diff --git a/README.md b/README.md
@@ -867,6 +867,7 @@
 |2970.统计移除递增子数组的数目I|简单|<a href="https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/07/10/LeetCode%202970.%E7%BB%9F%E8%AE%A1%E7%A7%BB%E9%99%A4%E9%80%92%E5%A2%9E%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AEI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/140310063" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-i/solutions/2836851/letmefly-2970tong-ji-yi-chu-di-zeng-zi-s-3d2z/" target="_blank">LeetCode题解</a>|
 |2974.最小数字游戏|简单|<a href="https://leetcode.cn/problems/minimum-number-game/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/07/12/LeetCode%202974.%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97%E6%B8%B8%E6%88%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/140365205" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-number-game/solutions/2840437/letmefly-2974zui-xiao-shu-zi-you-xi-pai-ib5em/" target="_blank">LeetCode题解</a>|
 |2982.找出出现至少三次的最长特殊子字符串II|中等|<a href="https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/30/LeetCode%202982.%E6%89%BE%E5%87%BA%E5%87%BA%E7%8E%B0%E8%87%B3%E5%B0%91%E4%B8%89%E6%AC%A1%E7%9A%84%E6%9C%80%E9%95%BF%E7%89%B9%E6%AE%8A%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139334864" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-ii/solutions/2795996/letmefly-2982zhao-chu-chu-xian-zhi-shao-9ubg1/" target="_blank">LeetCode题解</a>|
+|2999.统计强大整数的数目|困难|<a href="https://leetcode.cn/problems/count-the-number-of-powerful-integers/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/12/LeetCode%202999.%E7%BB%9F%E8%AE%A1%E5%BC%BA%E5%A4%A7%E6%95%B4%E6%95%B0%E7%9A%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147191672" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-the-number-of-powerful-integers/solutions/3649695/letmefly-2999tong-ji-qiang-da-zheng-shu-jnya8/" target="_blank">LeetCode题解</a>|
 |3011.判断一个数组是否可以变为有序|中等|<a href="https://leetcode.cn/problems/find-if-array-can-be-sorted/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/07/13/LeetCode%203011.%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E6%95%B0%E7%BB%84%E6%98%AF%E5%90%A6%E5%8F%AF%E4%BB%A5%E5%8F%98%E4%B8%BA%E6%9C%89%E5%BA%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/140391465" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-if-array-can-be-sorted/solutions/2841665/letmefly-3011pan-duan-yi-ge-shu-zu-shi-f-i9ck/" target="_blank">LeetCode题解</a>|
 |3019.按键变更的次数|简单|<a href="https://leetcode.cn/problems/number-of-changing-keys/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/07/LeetCode%203019.%E6%8C%89%E9%94%AE%E5%8F%98%E6%9B%B4%E7%9A%84%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144983704" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/number-of-changing-keys/solutions/3040949/letmefly-3019an-jian-bian-geng-de-ci-shu-pgzx/" target="_blank">LeetCode题解</a>|
 |3033.修改矩阵|简单|<a href="https://leetcode.cn/problems/modify-the-matrix/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/07/05/LeetCode%203033.%E4%BF%AE%E6%94%B9%E7%9F%A9%E9%98%B5/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/140219034" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/modify-the-matrix/solutions/2832430/letmefly-3033xiu-gai-ju-zhen-yuan-di-xiu-e0cy/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 2999.统计强大整数的数目.md b/Solutions/LeetCode 2999.统计强大整数的数目.md
