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.

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.

class Solution {
    public int minPartitions(String n) {
        char ch = ‘0‘;
        for(char c : n.toCharArray()) {
            ch = c > ch ? c : ch;
        }
        return ch - ‘0‘;
    }
}

　　还能说啥。。brainteaser

想想：99999要加几次？9次，8888呢？8次

所以次数就是这个数里最大的那一位。最小是1，最大是9.。。

1689. Partitioning Into Minimum Number Of Deci-Binary Numbers

原文：https://www.cnblogs.com/wentiliangkaihua/p/14815796.html