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.
Example 1
Input
n = "32"Output
3The number 32 can be written as 10 + 11 + 11, so 3 deci-binary numbers are needed.
Example 2
Input
n = "82734"Output
8The minimum number of positive deci-binary numbers needed to sum to 82734 is 8.
Constraints
- 1 <= n.length <= 10^5
- n consists of only digits.
- n does not contain any leading zeros and represents a positive integer.