Package g1601_1700.s1689_partitioning_into_minimum_number_of_deci_binary_numbers

Class Solution

java.lang.Object
g1601_1700.s1689_partitioning_into_minimum_number_of_deci_binary_numbers.Solution
public class Solution extends java.lang.Object
1689 - Partitioning Into Minimum Number Of Deci-Binary Numbers.

Medium

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.

Example 1:

Input: n = “32”

Output: 3

Explanation: 10 + 11 + 11 = 32

Example 2:

Input: n = “82734”

Output: 8

Example 3:

Input: n = “27346209830709182346”

Output: 9

Constraints:

  • 1 <= n.length <= 105
  • n consists of only digits.
  • n does not contain any leading zeros and represents a positive integer.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    minPartitions(java.lang.String n)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • minPartitions

      public int minPartitions(java.lang.String n)