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.

LeetCode Problem - 1689

class Solution {
    // Method to find the minimum number of partitions needed
    public int minPartitions(String n) {
        // Call the method to find the highest digit in the number
        return findHighestValue(n);
    }

    // Method to find the highest digit in a number
    public static int findHighestValue(String str){
        // Convert the string to a character array
        char[] strArray = str.toCharArray();

        // Initialize the highest value with the first digit
        int highestValue = Character.getNumericValue(strArray[0]);

        // Iterate through the digits of the number
        for (int i = 1; i < strArray.length; i++) {
            // Get the numeric value of the current digit
            int presentValue = Character.getNumericValue(strArray[i]);

            // If the current digit is greater than the highest value, update the highest value
            if (presentValue > highestValue) {
                highestValue = presentValue;
            }

            // If the highest value is 9, no need to check further digits, break the loop
            if (highestValue == 9) {
                break;
            }
        }
        // Return the highest value found
        return highestValue;
    }
}