update: 添加问题“2610.转换二维数组”的代码和题解(#825)

真是飞来横祸，莫名就躺枪了

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

Author: LetMeFly666

.commitmsg

@@ -1 +1,2 @@
-feat: under merge标签(#821)
+
+真是飞来横祸，莫名就躺枪了

Codes/2610-convert-an-array-into-a-2d-array-with-conditions.cpp

@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-19 19:54:08
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-19 19:55:17
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    vector<vector<int>> findMatrix(vector<int>& nums) {
+        vector<vector<int>> ans;
+        unordered_map<int, int> cnt;
+        for (int t : nums) {
+            cnt[t]++;
+            if (cnt[t] > ans.size()) {
+                ans.push_back({});
+            }
+            ans[cnt[t] - 1].push_back(t);
+        }
+        return ans;
+    }
+};

Codes/2610-convert-an-array-into-a-2d-array-with-conditions.go

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-19 20:03:37
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-19 20:05:02
+ */
+package main
+
+func findMatrix(nums []int) (ans [][]int) {
+    ma := map[int]int{}
+    for _, t := range nums {
+        ma[t]++
+        if ma[t] > len(ans) {
+            ans = append(ans, make([]int, 0))
+        }
+        ans[ma[t] - 1] = append(ans[ma[t]-1], t)
+    }
+    return
+}

Codes/2610-convert-an-array-into-a-2d-array-with-conditions.java

@@ -0,0 +1,26 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-19 19:58:16
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-19 20:03:10
+ */
+import java.util.HashMap;
+import java.util.Map;
+import java.util.ArrayList;
+import java.util.List;
+
+
+class Solution {
+    public List<List<Integer>> findMatrix(int[] nums) {
+        List<List<Integer>> ans = new ArrayList<>();
+        Map<Integer, Integer> ma = new HashMap<>();
+        for (int t : nums) {
+            ma.merge(t, 1, Integer::sum);
+            if (ma.get(t) > ans.size()) {
+                ans.add(new ArrayList<>());
+            }
+            ans.get(ma.get(t) - 1).add(t);
+        }
+        return ans;
+    }
+}

Codes/2610-convert-an-array-into-a-2d-array-with-conditions.py

@@ -0,0 +1,20 @@
+'''
+Author: LetMeFly
+Date: 2025-03-19 19:56:03
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-03-19 19:57:12
+'''
+from typing import List
+from collections import defaultdict
+
+
+class Solution:
+    def findMatrix(self, nums: List[int]) -> List[List[int]]:
+        ans: List[List[int]] = []
+        ma = defaultdict(int)
+        for t in nums:
+            ma[t] += 1
+            if ma[t] > len(ans):
+                ans.append([])
+            ans[ma[t] - 1].append(t)
+        return ans

README.md

@@ -780,6 +780,7 @@
 |2597.美丽子集的数目|中等|<a href="https://leetcode.cn/problems/the-number-of-beautiful-subsets/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/07/LeetCode%202597.%E7%BE%8E%E4%B8%BD%E5%AD%90%E9%9B%86%E7%9A%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146108576" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/the-number-of-beautiful-subsets/solutions/3601438/letmefly-2597mei-li-zi-ji-de-shu-mu-er-j-bqpi/" target="_blank">LeetCode题解</a>|
 |2600.K件物品的最大和|简单|<a href="https://leetcode.cn/problems/k-items-with-the-maximum-sum/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/07/05/LeetCode%202600.K%E4%BB%B6%E7%89%A9%E5%93%81%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131547457" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/k-items-with-the-maximum-sum/solutions/2331120/letmefly-2600k-jian-wu-pin-de-zui-da-he-08kcp/" target="_blank">LeetCode题解</a>|
 |2609.最长平衡子字符串|简单|<a href="https://leetcode.cn/problems/find-the-longest-balanced-substring-of-a-binary-string/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/11/08/LeetCode%202609.%E6%9C%80%E9%95%BF%E5%B9%B3%E8%A1%A1%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/134296484" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-longest-balanced-substring-of-a-binary-string/solutions/2518443/letmefly-2609zui-chang-ping-heng-zi-zi-f-bkn5/" target="_blank">LeetCode题解</a>|
+|2610.转换二维数组|中等|<a href="https://leetcode.cn/problems/convert-an-array-into-a-2d-array-with-conditions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/19/LeetCode%202610.%E8%BD%AC%E6%8D%A2%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/https://leetcode.cn/problems/convert-an-array-into-a-2d-array-with-conditions/solutions/3619707/letmefly-2610zhuan-huan-er-wei-shu-zu-ha-hjpa/" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/convert-an-array-into-a-2d-array-with-conditions/solutions/3619707/letmefly-2610zhuan-huan-er-wei-shu-zu-ha-hjpa/" target="_blank">LeetCode题解</a>|
 |2611.老鼠和奶酪|中等|<a href="https://leetcode.cn/problems/mice-and-cheese/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/06/07/LeetCode%202611.%E8%80%81%E9%BC%A0%E5%92%8C%E5%A5%B6%E9%85%AA/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131085720" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/mice-and-cheese/solutions/2300325/letmefly-2611lao-shu-he-nai-luo-pai-xu-t-axv5/" target="_blank">LeetCode题解</a>|
 |2614.对角线上的质数|简单|<a href="https://leetcode.cn/problems/prime-in-diagonal/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/18/LeetCode%202614.%E5%AF%B9%E8%A7%92%E7%BA%BF%E4%B8%8A%E7%9A%84%E8%B4%A8%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146356303" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/prime-in-diagonal/solutions/3618431/letmefly-2614dui-jiao-xian-shang-de-zhi-r77y1/" target="_blank">LeetCode题解</a>|
 |2639.查询网格图中每一列的宽度|简单|<a href="https://leetcode.cn/problems/find-the-width-of-columns-of-a-grid/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/04/27/LeetCode%202639.%E6%9F%A5%E8%AF%A2%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E6%AF%8F%E4%B8%80%E5%88%97%E7%9A%84%E5%AE%BD%E5%BA%A6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/138244991" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-width-of-columns-of-a-grid/solutions/2757678/letmefly-2639cha-xun-wang-ge-tu-zhong-me-w02k/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 2610.转换二维数组.md

@@ -0,0 +1,175 @@
+---
+title: 2610.转换二维数组：哈希表(一次遍历)
+date: 2025-03-19 20:06:36
+tags: [题解, LeetCode, 中等, 数组, 哈希表]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】2610.转换二维数组：哈希表(一次遍历)
+
+力扣题目链接：[https://leetcode.cn/problems/convert-an-array-into-a-2d-array-with-conditions/](https://leetcode.cn/problems/convert-an-array-into-a-2d-array-with-conditions/)
+
+<p>给你一个整数数组 <code>nums</code> 。请你创建一个满足以下条件的二维数组：</p>
+
+<ul>
+	<li>二维数组应该 <strong>只</strong> 包含数组 <code>nums</code> 中的元素。</li>
+	<li>二维数组中的每一行都包含 <strong>不同</strong> 的整数。</li>
+	<li>二维数组的行数应尽可能 <strong>少</strong> 。</li>
+</ul>
+
+<p>返回结果数组。如果存在多种答案，则返回其中任何一种。</p>
+
+<p>请注意，二维数组的每一行上可以存在不同数量的元素。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>nums = [1,3,4,1,2,3,1]
+<strong>输出：</strong>[[1,3,4,2],[1,3],[1]]
+<strong>解释：</strong>根据题目要求可以创建包含以下几行元素的二维数组：
+- 1,3,4,2
+- 1,3
+- 1
+nums 中的所有元素都有用到，并且每一行都由不同的整数组成，所以这是一个符合题目要求的答案。
+可以证明无法创建少于三行且符合题目要求的二维数组。</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>nums = [1,2,3,4]
+<strong>输出：</strong>[[4,3,2,1]]
+<strong>解释：</strong>nums 中的所有元素都不同，所以我们可以将其全部保存在二维数组中的第一行。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 200</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= nums.length</code></li>
+</ul>
+
+
+    
+## 解题方法：哈希表
+
+使用一个哈希表统计每个数出现的次数。
+
+遍历nums数组，统计当前元素的出现次数。若当前元素的出现次数大于答案数组的长度，就向答案数组中添加一个空数组。最后，将当前元素t加入$ans[出现次数-1]$中。
+
++ 时间复杂度$O(len(nums))$
++ 空间复杂度$O(len(nums))$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-19 19:54:08
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-19 19:55:17
+ */
+class Solution {
+public:
+    vector<vector<int>> findMatrix(vector<int>& nums) {
+        vector<vector<int>> ans;
+        unordered_map<int, int> cnt;
+        for (int t : nums) {
+            cnt[t]++;
+            if (cnt[t] > ans.size()) {
+                ans.push_back({});
+            }
+            ans[cnt[t] - 1].push_back(t);
+        }
+        return ans;
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-03-19 19:56:03
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-03-19 19:57:12
+'''
+from typing import List
+from collections import defaultdict
+
+
+class Solution:
+    def findMatrix(self, nums: List[int]) -> List[List[int]]:
+        ans: List[List[int]] = []
+        ma = defaultdict(int)
+        for t in nums:
+            ma[t] += 1
+            if ma[t] > len(ans):
+                ans.append([])
+            ans[ma[t] - 1].append(t)
+        return ans
+
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-19 19:58:16
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-19 20:03:10
+ */
+import java.util.HashMap;
+import java.util.Map;
+import java.util.ArrayList;
+import java.util.List;
+
+
+class Solution {
+    public List<List<Integer>> findMatrix(int[] nums) {
+        List<List<Integer>> ans = new ArrayList<>();
+        Map<Integer, Integer> ma = new HashMap<>();
+        for (int t : nums) {
+            ma.merge(t, 1, Integer::sum);
+            if (ma.get(t) > ans.size()) {
+                ans.add(new ArrayList<>());
+            }
+            ans.get(ma.get(t) - 1).add(t);
+        }
+        return ans;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-19 20:03:37
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-19 20:05:02
+ */
+package main
+
+func findMatrix(nums []int) (ans [][]int) {
+    ma := map[int]int{}
+    for _, t := range nums {
+        ma[t]++
+        if ma[t] > len(ans) {
+            ans = append(ans, make([]int, 0))
+        }
+        ans[ma[t] - 1] = append(ans[ma[t]-1], t)
+    }
+    return
+}
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/146379435/)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/03/19/LeetCode%202610.%E8%BD%AC%E6%8D%A2%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -1052,6 +1052,8 @@ categories: [自用]
 |||
 |prudence|n. 谨慎，节俭，精明|
 |dramatist|n. 剧作家，编剧|
+|||
+|dike|n. 提防，渠，岩脉，女同性恋者<br/>v. 筑堤防护，开沟排水|
 
 <p class="wordCounts">单词收录总数</p>
 

Solutions/Other-Japanese-LearningNotes.md

@@ -421,7 +421,8 @@ xx型
 |車(くるま)|汽车|
 |自転車(じてんしゃ)|自行车|
 |自動車(じどうしゃ)|车|
-|バス|公交车|
+|バス|公交车/巴士|
+|シャトルバス|穿梭巴士|
 |地下鉄(ちかてつ)|地铁|
 |タクシー|出租车|
 |空港(くうこう)|机场|
@@ -463,6 +464,8 @@ xx型
 |花瓶(かびん)|花瓶|
 |携帯(けいたい)|手机|
 |薬(くすり)|药|
+|ゴミ|垃圾|
+|広告(こうこく)|广告|
 |||
 |シャツ|衬衫|
 |セーター|毛衣|
@@ -1280,7 +1283,7 @@ xx型
 |アンドリューさんの奥さんはいましたか。<br/>安德鲁的夫人在吗？|
 |建物は新しかったです。<br/>建筑是新的。|
 |ダニエルさんの奥さんは素敵な人でした。<br/>丹尼尔的夫人是个很棒的人。|
-|<br/>|
+|広告でホテルを見つけました。<br/>我在广告上发现这家酒店。|
 |<br/>|
 |<br/>|
 |<br/>|

Solutions/Other-Notes-Mianjing.md

@@ -270,7 +270,7 @@ MySQL5.5后默认使用InnoDB作为存储引擎。**建表**时聚簇索引：
 对于联合索引`(a, b)`，执行语句`select * from table where a > 1 and b = 2`的时候，只有`a`字段能用到索引。在B+树中搜索到`a > 1`的范围后，还需要看`b = 2`是否满足。
 
 + 在MySQL5.6之前，只能从主键值一个个回表，到主键索引上找出数据行并判断是否满足`b = 2`。
-+ 在MySQL5.6引入了**索引下推优化**(index condition pushdown, ICP)，可以在联合索引遍历国策红肿对联合索引中包含的字段做判断，直接过滤掉不满足条件的记录，减少回表次数。
++ 在MySQL5.6引入了**索引下推优化**(index condition pushdown, ICP)，可以在联合索引遍历过程中对联合索引中包含的字段做判断，直接过滤掉不满足条件的记录，减少回表次数。
 
 下推其实就是将部分上层(服务层)负责的事情交给了下层(引擎层)去处理。