Force deduction solution summary 1189- maximum number of "balloons"

Original link ： Power button

describe ：

Give you a string text, You need to use text To piece together as many words as possible "balloon"（ balloon ）.

character string text Each letter in can only be used once at most . Please return the maximum number of words you can piece together "balloon".

Example 1：

Input ：text = "nlaebolko"
Output ：1
Example 2：

Input ：text = "loonbalxballpoon"
Output ：2
Example 3：

Input ：text = "leetcode"
Output ：0

source ： Power button （LeetCode）
link ：https://leetcode-cn.com/problems/maximum-number-of-balloons
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

Their thinking ：

*  Their thinking ：
*  Use an array to store 'a' To 'z' this 26 Letters . And then judge a,b,l/2,o/2,n The minimum of these numbers is good .

Code ：

public class Solution1189 {

    public int maxNumberOfBalloons(String text) {
        char[] chars = text.toCharArray();
        int[] ints = new int[26];
        for (int i = 0; i < chars.length; i++) {
            char aChar = chars[i];
            ints[aChar - 'a']++;
        }
        int min = Math.min(ints[0], ints['b' - 'a']);
        min = Math.min(min, ints['l' - 'a'] / 2);
        min = Math.min(min, ints['o' - 'a'] / 2);
        min = Math.min(min, ints['n' - 'a']);
        return min;
    }
}