update: 添加问题“1399.统计最大组的数目”的代码和题解(#896)

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

Author: LetMeFly666

Codes/1399-count-largest-group.cpp

@@ -0,0 +1,30 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-23 13:17:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-23 13:19:12
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int countLargestGroup(int n) {
+        unordered_map<int, int> bin;
+        int maxTimes = 0;
+        for (int i = 1; i <= n; i++) {
+            int cnt = 0, temp = i;
+            while (temp) {
+                cnt += temp % 10;
+                temp /= 10;
+            }
+            maxTimes = max(maxTimes, ++bin[cnt]);
+        }
+        int ans = 0;
+        for (auto [a, b] : bin) {
+            ans += b == maxTimes;
+        }
+        return ans;
+    }
+};

Codes/1399-count-largest-group.go

@@ -0,0 +1,26 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-23 13:26:23
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-23 13:28:41
+ */
+package main
+
+func countLargestGroup(n int) (ans int) {
+    times := map[int]int{}
+    maxTimes := 0
+    for i := 1; i <= n; i++ {
+        cnt := 0
+        for temp := i; temp > 0; temp /= 10 {
+            cnt += temp % 10
+        }
+        times[cnt]++
+        maxTimes = max(maxTimes, times[cnt])
+    }
+    for _, val := range times {
+        if val == maxTimes {
+            ans++
+        }
+    }
+    return
+}

Codes/1399-count-largest-group.java

@@ -0,0 +1,30 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-23 13:23:09
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-23 13:24:57
+ */
+import java.util.Map;
+import java.util.HashMap;
+
+class Solution {
+    public int countLargestGroup(int n) {
+        Map<Integer, Integer> times = new HashMap<>();
+        int maxTimes = 0;
+        for (int i = 1; i <= n; i++) {
+            int cnt = 0, temp = i;
+            while (temp > 0) {
+                cnt += temp % 10;
+                temp /= 10;
+            }
+            maxTimes = Math.max(maxTimes, times.merge(cnt, 1, Integer::sum));
+        }
+        int ans = 0;
+        for (Map.Entry<Integer, Integer> pair : times.entrySet()) {
+            if (pair.getValue() == maxTimes) {
+                ans++;
+            }
+        }
+        return ans;
+    }
+}

Codes/1399-count-largest-group.py

@@ -0,0 +1,17 @@
+'''
+Author: LetMeFly
+Date: 2025-04-23 13:20:37
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-04-23 13:22:37
+'''
+from collections import defaultdict
+
+class Solution:
+    def countLargestGroup(self, n: int) -> int:
+        counter = defaultdict(int)
+        maxTimes = 0
+        for i in range(1, n + 1):
+            cnt = sum(map(int, str(i)))
+            counter[cnt] += 1
+            maxTimes = max(maxTimes, counter[cnt])
+        return sum(b == maxTimes for a, b in counter.items())

README.md

@@ -519,6 +519,7 @@
 |1375.二进制字符串前缀一致的次数|中等|<a href="https://leetcode.cn/problems/number-of-times-binary-string-is-prefix-aligned/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/06/14/LeetCode%201375.%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%89%8D%E7%BC%80%E4%B8%80%E8%87%B4%E7%9A%84%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131213418" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/number-of-times-binary-string-is-prefix-aligned/solutions/2309139/letmefly-1375er-jin-zhi-zi-fu-chuan-qian-odu7/" target="_blank">LeetCode题解</a>|
 |1376.通知所有员工所需的时间|中等|<a href="https://leetcode.cn/problems/time-needed-to-inform-all-employees/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/05/01/LeetCode%201376.%E9%80%9A%E7%9F%A5%E6%89%80%E6%9C%89%E5%91%98%E5%B7%A5%E6%89%80%E9%9C%80%E7%9A%84%E6%97%B6%E9%97%B4/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/130458959" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/time-needed-to-inform-all-employees/solutions/2252783/letmefly-1376tong-zhi-suo-you-yuan-gong-v721e/" target="_blank">LeetCode题解</a>|
 |1379.找出克隆二叉树中的相同节点|简单|<a href="https://leetcode.cn/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/04/03/LeetCode%201379.%E6%89%BE%E5%87%BA%E5%85%8B%E9%9A%86%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E7%9B%B8%E5%90%8C%E8%8A%82%E7%82%B9/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/137341930" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/solutions/2722126/letmefly-1379zhao-chu-ke-long-er-cha-shu-717e/" target="_blank">LeetCode题解</a>|
+|1399.统计最大组的数目|简单|<a href="https://leetcode.cn/problems/count-largest-group/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/23/LeetCode%201399.%E7%BB%9F%E8%AE%A1%E6%9C%80%E5%A4%A7%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147448113" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-largest-group/solutions/3659689/letmefly-1399tong-ji-zui-da-zu-de-shu-mu-09kx/" target="_blank">LeetCode题解</a>|
 |1402.做菜顺序|困难|<a href="https://leetcode.cn/problems/reducing-dishes/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/10/22/LeetCode%201402.%E5%81%9A%E8%8F%9C%E9%A1%BA%E5%BA%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/133974648" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/reducing-dishes/solutions/2493595/letmefly-1402zuo-cai-shun-xu-pai-xu-er-f-s5te/" target="_blank">LeetCode题解</a>|
 |1403.非递增顺序的最小子序列|简单|<a href="https://leetcode.cn/problems/minimum-subsequence-in-non-increasing-order/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/04/LeetCode%201403.%E9%9D%9E%E9%80%92%E5%A2%9E%E9%A1%BA%E5%BA%8F%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E5%BA%8F%E5%88%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126155397" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-subsequence-in-non-increasing-order/solution/letmefly-1403fei-di-zeng-shun-xu-de-zui-h56ht/" target="_blank">LeetCode题解</a>|
 |1408.数组中的字符串匹配|简单|<a href="https://leetcode.cn/problems/string-matching-in-an-array/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/06/LeetCode%201408.%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126189255" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/string-matching-in-an-array/solution/letmefly-1408shu-zu-zhong-de-zi-fu-chuan-v90u/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 1399.统计最大组的数目.md

@@ -0,0 +1,192 @@
+---
+title: 1399.统计最大组的数目：哈希表模拟（简单题简单做）
+date: 2025-04-23 13:29:46
+tags: [题解, LeetCode, 简单, 哈希表, 数学]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】1399.统计最大组的数目：哈希表模拟（简单题简单做）
+
+力扣题目链接：[https://leetcode.cn/problems/count-largest-group/](https://leetcode.cn/problems/count-largest-group/)
+
+<p>给你一个整数 <code>n</code>&nbsp;。请你先求出从 <code>1</code>&nbsp;到 <code>n</code> 的每个整数 10 进制表示下的数位和（每一位上的数字相加），然后把数位和相等的数字放到同一个组中。</p>
+
+<p>请你统计每个组中的数字数目，并返回数字数目并列最多的组有多少个。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>n = 13
+<strong>输出：</strong>4
+<strong>解释：</strong>总共有 9 个组，将 1 到 13 按数位求和后这些组分别是：
+[1,10]，[2,11]，[3,12]，[4,13]，[5]，[6]，[7]，[8]，[9]。总共有 4 个组拥有的数字并列最多。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>n = 2
+<strong>输出：</strong>2
+<strong>解释：</strong>总共有 2 个大小为 1 的组 [1]，[2]。
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre><strong>输入：</strong>n = 15
+<strong>输出：</strong>6
+</pre>
+
+<p><strong>示例 4：</strong></p>
+
+<pre><strong>输入：</strong>n = 24
+<strong>输出：</strong>5
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 10^4</code></li>
+</ul>
+
+
+    
+## 解题方法：哈希表
+
+如何统计一个数字十进制下的每一位之和？
+
+> 在这个数字(假设为$t$)不为0时，不断累加这个数的个位（$t\%10$），并将这个数除以$10$（向下取整）。
+
+使用一个哈希表，键为“一个数的每一位之和”，值为这个“和”的出现次数。
+
+统计最大的“值”，然后统计有多少个键值对的值是这个最大的值。
+
++ 时间复杂度$O(n\log_{10}n)$
++ 空间复杂度$O(n)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-23 13:17:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-23 13:19:12
+ */
+
+class Solution {
+public:
+    int countLargestGroup(int n) {
+        unordered_map<int, int> bin;
+        int maxTimes = 0;
+        for (int i = 1; i <= n; i++) {
+            int cnt = 0, temp = i;
+            while (temp) {
+                cnt += temp % 10;
+                temp /= 10;
+            }
+            maxTimes = max(maxTimes, ++bin[cnt]);
+        }
+        int ans = 0;
+        for (auto [a, b] : bin) {
+            ans += b == maxTimes;
+        }
+        return ans;
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-04-23 13:20:37
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-04-23 13:22:37
+'''
+from collections import defaultdict
+
+class Solution:
+    def countLargestGroup(self, n: int) -> int:
+        counter = defaultdict(int)
+        maxTimes = 0
+        for i in range(1, n + 1):
+            cnt = sum(map(int, str(i)))
+            counter[cnt] += 1
+            maxTimes = max(maxTimes, counter[cnt])
+        return sum(b == maxTimes for a, b in counter.items())
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-23 13:23:09
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-23 13:24:57
+ */
+import java.util.Map;
+import java.util.HashMap;
+
+class Solution {
+    public int countLargestGroup(int n) {
+        Map<Integer, Integer> times = new HashMap<>();
+        int maxTimes = 0;
+        for (int i = 1; i <= n; i++) {
+            int cnt = 0, temp = i;
+            while (temp > 0) {
+                cnt += temp % 10;
+                temp /= 10;
+            }
+            maxTimes = Math.max(maxTimes, times.merge(cnt, 1, Integer::sum));
+        }
+        int ans = 0;
+        for (Map.Entry<Integer, Integer> pair : times.entrySet()) {
+            if (pair.getValue() == maxTimes) {
+                ans++;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-23 13:26:23
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-23 13:28:41
+ */
+package main
+
+func countLargestGroup(n int) (ans int) {
+    times := map[int]int{}
+    maxTimes := 0
+    for i := 1; i <= n; i++ {
+        cnt := 0
+        for temp := i; temp > 0; temp /= 10 {
+            cnt += temp % 10
+        }
+        times[cnt]++
+        maxTimes = max(maxTimes, times[cnt])
+    }
+    for _, val := range times {
+        if val == maxTimes {
+            ans++
+        }
+    }
+    return
+}
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/147448113)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/04/23/LeetCode%201399.%E7%BB%9F%E8%AE%A1%E6%9C%80%E5%A4%A7%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -1105,6 +1105,10 @@ categories: [自用]
 |ferrous|adj. 含铁的，铁的|
 |||
 |stammer|v. 口吃，结结巴巴地说<br>n. 口吃，结巴|
+|||
+|terrace|n. 露天平台，阳台，阶梯看台，梯田|
+|||
+|bottle-neck|n. 瓶颈，道路上的狭窄处|
 
 <p class="wordCounts">单词收录总数</p>
 

Solutions/Other-Japanese-LearningNotes.md

@@ -252,6 +252,7 @@ xx型
 |お酒(おさけ)|酒|
 |てりやき|照烧|
 |てんぷら|天妇罗|
+|味噌汁(みそしる)|味增汤|
 |なっとう|纳豆|
 |ごはん|米饭|
 |みず|水|
@@ -268,6 +269,7 @@ xx型
 |お菓子(おかし)|零食|
 |卵(たまご)|鸡蛋|
 |シリアル|麦片|
+|蕎麦(そば)|荞麦(面)|
 |おにぎり|饭团🍙|
 |塩(しお)|盐|
 |醬油(しょうゆ)|酱油|
@@ -890,6 +892,7 @@ xx型
 |でき|会/能做到|
 |違う(ちがう)|不对/不同|
 |素敵(すてき)|好/漂亮|
+|必ず(かならず)|一定|
 |||
 |牛肉(ぎゅうにく)|牛肉|
 |豚肉(ぶたにく)|猪肉|
@@ -1312,7 +1315,7 @@ xx型
 |部屋は六階でした。<br/>房间在六楼。|
 |スタッフに言いました。<br/>跟员工说了。|
 |部屋のシャワーはぬるかったです。<br/>房间的水不够热(只是温的)。|
-|<br/>|
+|必ず悪いレビューをたくさん書きます。<br/>我一定会写很多差评！|
 |<br/>|
 |<br/>|
 |<br/>|