From de2b5b466454d968ee41881ba7dc6cf99758afb5 Mon Sep 17 00:00:00 2001
From: Eat-Swap <root@eatswap.org>
Date: Tue, 28 Jun 2022 00:00:38 +0800
Subject: [PATCH] add: 220627

---
 cpp/2206/220627.cpp | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 cpp/2206/220627.cpp

diff --git a/cpp/2206/220627.cpp b/cpp/2206/220627.cpp
new file mode 100644
index 0000000..2dea7c4
--- /dev/null
+++ b/cpp/2206/220627.cpp
@@ -0,0 +1,15 @@
+#include <string>
+#include <algorithm>
+
+/**
+ * 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
+ * A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For example, 101 and 1100 are deci-binary, while 112 and 3001 are not.
+ * Given a string n that represents a positive decimal integer, return the minimum number of positive deci-binary numbers needed so that they sum up to n.
+ */
+
+class Solution {
+public:
+	int minPartitions(const std::string& n) {
+		return *std::max_element(n.begin(), n.end()) - 'a';
+	}
+};