LeetCode 1189. Maximum number of "balloons"

1189. “ balloon ” Maximum number of

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

Tips ：

• 1 <= text.length <= 10^4
• text All consist of lowercase English letters

Two 、 Method 1

simulation

class Solution {
    
    public int maxNumberOfBalloons(String text) {
    
        int[] cnt = new int[5];
        for (int i = 0; i < text.length(); i++) {
    
            char c = text.charAt(i);
            if (c == 'b') {
    
                cnt[0]++;
            } else if (c == 'a') {
    
                cnt[1]++;
            } else if (c == 'l') {
    
                cnt[2]++;
            } else if (c == 'o') {
    
                cnt[3]++;
            } else if (c == 'n') {
    
                cnt[4]++;
            }
        }
        cnt[2] /= 2;
        cnt[3] /= 2;
        return Arrays.stream(cnt).min().getAsInt();
    }
}

Complexity analysis

• Time complexity ：O(n + C), among nn Is the length of the string ,C Indicates the number of types of characters in a word , In the subject C = 5. You need to traverse the string , And find the minimum number of characters in the word .

• Spatial complexity ：O(C ),C Indicates the number of types of characters in a word , In the subject C=5. need O(C ) The statistical number of characters stored in the space of .