1689. Partitioning Into Minimum Number Of Deci-Binary Numbers Обновлено: 2024-03-12 1 мин Algorithms , LeetCode СодержаниеLeetCode problem 1689class Solution: def minPartitions(self, n: str) -> int: return int(max(n))