feat: add solutions to lc problem: No.1689. Partitioning Into Minimum Number Of Deci-Binary Numbers

Author: yanglbme

solution/1600-1699/1689.Partitioning Into Minimum Number Of Deci-Binary Numbers/README.md

@@ -41,27 +41,68 @@
 	<li><code>n</code> 不含任何前导零并总是表示正整数</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+题目等价于找字符串中的最大数。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minPartitions(self, n: str) -> int:
+        return int(max(n))
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int minPartitions(String n) {
+        int res = 0;
+        for (char c : n.toCharArray()) {
+            res = Math.max(res, c - '0');
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minPartitions(string n) {
+        int res = 0;
+        for (auto& c : n) {
+            res = max(res, c - '0');
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minPartitions(n string) int {
+	res := 0
+	for _, c := range n {
+		t := int(c - '0')
+		if t > res {
+			res = t
+		}
+	}
+	return res
+}
 ```
 
 ### **...**

solution/1600-1699/1689.Partitioning Into Minimum Number Of Deci-Binary Numbers/README_EN.md

@@ -6,18 +6,12 @@
 
 <p>A decimal number is called <strong>deci-binary</strong> if each of its digits is either <code>0</code> or <code>1</code> without any leading zeros. For example, <code>101</code> and <code>1100</code> are <strong>deci-binary</strong>, while <code>112</code> and <code>3001</code> are not.</p>
 
-
-
 <p>Given a string <code>n</code> that represents a positive decimal integer, return <em>the <strong>minimum</strong> number of positive <strong>deci-binary</strong> numbers needed so that they sum up to </em><code>n</code><em>.</em></p>
 
-
-
 <p>&nbsp;</p>
 
 <p><strong>Example 1:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> n = &quot;32&quot;
@@ -28,12 +22,8 @@
 
 </pre>
 
-
-
 <p><strong>Example 2:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> n = &quot;82734&quot;
@@ -42,12 +32,8 @@
 
 </pre>
 
-
-
 <p><strong>Example 3:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> n = &quot;27346209830709182346&quot;
@@ -56,14 +42,10 @@
 
 </pre>
 
-
-
 <p>&nbsp;</p>
 
 <p><strong>Constraints:</strong></p>
 
-
-
 <ul>
 	<li><code>1 &lt;= n.length &lt;= 10<sup>5</sup></code></li>
 	<li><code>n</code> consists of only digits.</li>
@@ -77,13 +59,53 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minPartitions(self, n: str) -> int:
+        return int(max(n))
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int minPartitions(String n) {
+        int res = 0;
+        for (char c : n.toCharArray()) {
+            res = Math.max(res, c - '0');
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minPartitions(string n) {
+        int res = 0;
+        for (auto& c : n) {
+            res = max(res, c - '0');
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minPartitions(n string) int {
+	res := 0
+	for _, c := range n {
+		t := int(c - '0')
+		if t > res {
+			res = t
+		}
+	}
+	return res
+}
 ```
 
 ### **...**

solution/1600-1699/1689.Partitioning Into Minimum Number Of Deci-Binary Numbers/Solution.cpp

@@ -0,0 +1,10 @@
+class Solution {
+public:
+    int minPartitions(string n) {
+        int res = 0;
+        for (auto& c : n) {
+            res = max(res, c - '0');
+        }
+        return res;
+    }
+};

solution/1600-1699/1689.Partitioning Into Minimum Number Of Deci-Binary Numbers/Solution.go

@@ -0,0 +1,10 @@
+func minPartitions(n string) int {
+	res := 0
+	for _, c := range n {
+		t := int(c - '0')
+		if t > res {
+			res = t
+		}
+	}
+	return res
+}

solution/1600-1699/1689.Partitioning Into Minimum Number Of Deci-Binary Numbers/Solution.java

@@ -0,0 +1,9 @@
+class Solution {
+    public int minPartitions(String n) {
+        int res = 0;
+        for (char c : n.toCharArray()) {
+            res = Math.max(res, c - '0');
+        }
+        return res;
+    }
+}

solution/1600-1699/1689.Partitioning Into Minimum Number Of Deci-Binary Numbers/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def minPartitions(self, n: str) -> int:
+        return int(max(n))