update: 添加问题“1689.十-二进制数的最少数目”的代码和题解 (#1419)

1689 - AC.cpp+py+go+java+rust + CE.java (#1417) + (en)

cpp - AC,100.00%,8.79%
py - AC,38.96%,29.87%
go - AC,100.00%,62.50%
java - AC,5.45%,60.00%
rust - AC,100.00%,63.64%
rust.rust - AC,100.00%,36.36%

Signed-off-by: LetMeFly666 <Tisfy@qq.com>

Author: LetMeFly666

.commitmsg

@@ -0,0 +1,8 @@
+1689 - AC.cpp+py+go+java+rust + CE.java (#1417) + (en)
+
+cpp - AC,100.00%,8.79%
+py - AC,38.96%,29.87%
+go - AC,100.00%,62.50%
+java - AC,5.45%,60.00%
+rust - AC,100.00%,63.64%
+rust.rust - AC,100.00%,36.36%

Codes/1689-partitioning-into-minimum-number-of-deci-binary-numbers.cpp

@@ -0,0 +1,20 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-01 19:50:43
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-01 19:51:09
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int minPartitions(string n) {
+        char M = '0';
+        for (char c : n) {
+            M = max(M, c);
+        }
+        return M - '0';
+    }
+};

Codes/1689-partitioning-into-minimum-number-of-deci-binary-numbers.go

@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-01 19:50:43
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-01 20:10:52
+ */
+package main
+
+// 要的是max不是min别搞错了
+func max1689(a, b rune) rune {
+    if a < b {
+        return b
+    }
+    return a
+}
+
+func minPartitions(n string) int {
+    m := rune('0')
+    for _, c := range n {
+        m = max1689(m, c)
+    }
+    return int(byte(m) - '0')
+}

Codes/1689-partitioning-into-minimum-number-of-deci-binary-numbers.java

@@ -0,0 +1,14 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-01 19:50:43
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-01 20:20:09
+ */
+// THIS CANNOT BE ACCPETED
+class Solution {
+    public int minPartitions(String n) {
+        char m = '0';
+        n.chars().forEach(c -> m = Math.max(m, (char) c));
+        return m - '0';
+    }
+}

Codes/1689-partitioning-into-minimum-number-of-deci-binary-numbers.py

@@ -0,0 +1,9 @@
+'''
+Author: LetMeFly
+Date: 2026-03-01 19:50:43
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-03-01 19:52:13
+'''
+class Solution:
+    def minPartitions(self, n: str) -> int:
+        return ord(max(n)) - ord('0')  # 记得python str不能直接相减

Codes/1689-partitioning-into-minimum-number-of-deci-binary-numbers.rs

@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-01 19:50:43
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-01 20:23:19
+ */
+impl Solution {
+    pub fn min_partitions(n: String) -> i32 {
+        let mut m = '0';
+        for c in n.chars() {
+            if c > m {
+                m = c;
+            }
+        }
+        (m as i32) - ('0' as i32)
+    }
+}

Codes/1689-partitioning-into-minimum-number-of-deci-binary-numbers_AC.java

@@ -0,0 +1,12 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-01 19:50:43
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-01 20:20:21
+ */
+
+class Solution {
+    public int minPartitions(String n) {
+        return n.chars().max().getAsInt() - '0';
+    }
+}

Codes/1689-partitioning-into-minimum-number-of-deci-binary-numbers_more-rust.rs

@@ -0,0 +1,11 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-01 19:50:43
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-01 20:26:52
+ */
+impl Solution {
+    pub fn min_partitions(n: String) -> i32 {
+        (*n.as_bytes().iter().max().unwrap() - b'0') as i32
+    }
+}

Codes/lib.rs

@@ -2,11 +2,11 @@
  * @Author: LetMeFly
  * @Date: 2025-08-07 14:11:36
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2026-02-15 18:57:13
+ * @LastEditTime: 2026-03-01 20:25:21
  */
 pub struct Solution;
 
-include!("1523-count-odd-numbers-in-an-interval-range_20260219.rs");  // 这个fileName是会被脚本替换掉的
+include!("1689-partitioning-into-minimum-number-of-deci-binary-numbers_more-rust.rs");  // 这个fileName是会被脚本替换掉的
 
 #[derive(Debug, PartialEq, Eq)]
 pub struct TreeNode {

README.md

@@ -641,6 +641,7 @@
 |1680.连接连续二进制数字|中等|<a href="https://leetcode.cn/problems/concatenation-of-consecutive-binary-numbers/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/03/01/LeetCode%201680.%E8%BF%9E%E6%8E%A5%E8%BF%9E%E7%BB%AD%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E5%AD%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/158535683" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/concatenation-of-consecutive-binary-numbers/solutions/3910694/letmefly-1680lian-jie-lian-xu-er-jin-zhi-54sd/" target="_blank">LeetCode题解</a>|
 |1684.统计一致字符串的数目|简单|<a href="https://leetcode.cn/problems/count-the-number-of-consistent-strings/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/11/08/LeetCode%201684.%E7%BB%9F%E8%AE%A1%E4%B8%80%E8%87%B4%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127743936" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-the-number-of-consistent-strings/solutions/1955993/letmefly-1684tong-ji-yi-zhi-zi-fu-chuan-d0rfp/" target="_blank">LeetCode题解</a>|
 |1686.石子游戏VI|中等|<a href="https://leetcode.cn/problems/stone-game-vi/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/02/02/LeetCode%201686.%E7%9F%B3%E5%AD%90%E6%B8%B8%E6%88%8FVI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/135998504" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/stone-game-vi/solutions/2629147/letmefly-1686shi-zi-you-xi-vitan-xin-pai-8p3b/" target="_blank">LeetCode题解</a>|
+|1689.十-二进制数的最少数目|中等|<a href="https://leetcode.cn/problems/partitioning-into-minimum-number-of-deci-binary-numbers/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/03/01/LeetCode%201689.%E5%8D%81-%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%91%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/158543334" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/partitioning-into-minimum-number-of-deci-binary-numbers/solutions/3911137/letmefly-1689shi-er-jin-zhi-shu-de-zui-s-5njq/" target="_blank">LeetCode题解</a>|
 |1694.重新格式化电话号码|简单|<a href="https://leetcode.cn/problems/reformat-phone-number/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/10/01/LeetCode%201694.%E9%87%8D%E6%96%B0%E6%A0%BC%E5%BC%8F%E5%8C%96%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127131733" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/reformat-phone-number/solution/letmefly-1694zhong-xin-ge-shi-hua-dian-h-402n/" target="_blank">LeetCode题解</a>|
 |1695.删除子数组的最大得分|中等|<a href="https://leetcode.cn/problems/maximum-erasure-value/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/07/23/LeetCode%201695.%E5%88%A0%E9%99%A4%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/149602144" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-erasure-value/solutions/3732304/letmefly-1695shan-chu-zi-shu-zu-de-zui-d-sljo/" target="_blank">LeetCode题解</a>|
 |1700.无法吃午餐的学生数量|简单|<a href="https://leetcode.cn/problems/number-of-students-unable-to-eat-lunch/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/10/19/LeetCode%201700.%E6%97%A0%E6%B3%95%E5%90%83%E5%8D%88%E9%A4%90%E7%9A%84%E5%AD%A6%E7%94%9F%E6%95%B0%E9%87%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127402719" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/number-of-students-unable-to-eat-lunch/solution/letmefly-1700wu-fa-chi-wu-can-de-xue-she-o9cn/" target="_blank">LeetCode题解</a>|