1189. Maximum number of "balloons"

subject

1189.“ balloon ” Maximum number of

The main idea of the topic

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”.

Examples

Data scale

Ideas

Considering the composition of words $balloon$, There is no need to care about their order . And it is clear that each letter can only be used once , So count the number of each letter directly , Then the number of words that can be formed at last is $min(b,a,l/2,o/2,n)$.

Code

class Solution {
    
public:
    int vis[30];
    int maxNumberOfBalloons(string text) {
    
        
        for(int i=0;i<text.length();i++){
    
            vis[text[i]-'a']++;
        }
        int ans=min(vis[1],min(vis[0],min(vis['l'-'a']/2,min(vis['o'-'a']/2,vis['n'-'a']))));
        return ans;
    }
};