[leetcode daily question] number of enclaves

The number of enclaves
difficulty ： Simple

It can be used int The array records the number of occurrences of each character , Cyclic subtraction balloon The number of occurrences of each character , When it is not enough to reduce , Out of the loop .
The code is as follows ：

	public int maxNumberOfBalloons(String text) {
    
        char[] chars = text.toCharArray();
        int[] tmp = new int[128];
        for (char aChar : chars) {
    
            tmp[aChar]++;
        }
        int res = 0;
        while(tmp['a']>=1&&tmp['b']>=1&&tmp['a']>=1&&tmp['l']>=2&&tmp['o']>=2&&tmp['n']>=1){
    
            res++;
            tmp['b']--;
            tmp['a']--;
            tmp['l']--;
            tmp['l']--;
            tmp['o']--;
            tmp['o']--;
            tmp['n']--;
        }
        return res;
    }

Execution results ： success