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
字符串n代表了一个十进制数,问至少多少个“二进制数”相加能得到n,
这里的“二进制数”指的是只有0,1组成的十进制数。
思路:
问的是至少多少个"二进制数“相加能得到n,
而"二进制数“每位最大的数字是1,
所以只需要看n中最大的数字number,这个number至少是由number个1相加才能得到,
至于其他位,都比number小,可以通过凑0的方式解决。
public int minPartitions(String n) {
int res = 0;
for(int i = 0; i < n.length(); i++) {
res = Math.max(res, n.charAt(i) - '0');
}
return res;
}