add 1689

fishercoder1534 · fishercoder1534 · commit d65452e6e910 · 2021-05-26T07:42:59.000-07:00
diff --git a/README.md b/README.md
@@ -86,6 +86,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1700|[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1700.java) ||Easy|Array|
 |1694|[Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1694.java) ||Easy|String|
 |1690|[Stone Game VII](https://leetcode.com/problems/stone-game-vii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1690.java) ||Medium|DP|
+|1689|[Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1689.java) ||Medium|Greedy|
 |1688|[Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1688.java) ||Easy|Backtracking|
 |1686|[Stone Game VI](https://leetcode.com/problems/stone-game-vi/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1686.java) ||Medium|Greedy|
 |1685|[Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1685.java) |[:tv:](https://youtu.be/WYe644djV30)|Medium|Math, Greedy|
diff --git a/src/main/java/com/fishercoder/solutions/_1689.java b/src/main/java/com/fishercoder/solutions/_1689.java
@@ -0,0 +1,14 @@
+package com.fishercoder.solutions;
+
+public class _1689 {
+    public static class Solution1 {
+        public int minPartitions(String n) {
+            int max = 0;
+            for (char c : n.toCharArray()) {
+                int num = Integer.parseInt(c + "");
+                max = Math.max(max, num);
+            }
+            return max;
+        }
+    }
+}
