力扣 （LeetCode）1189.气球的最大数量

仅用于学习记录

题目

题解

class Solution {
    public int maxNumberOfBalloons(String text) {
    char[] ar = text.toCharArray();
    int a=0,b=0,c=0,d=0,e=0;
    for(int i=0;i<text.length();i++){
    if(ar[i]=='b') a++;
    else if(ar[i]=='a') b++;
    else if(ar[i]=='l') c++;
    else if(ar[i]=='o') d++;
    else if(ar[i]=='n') e++;
    }
    c=c/2;
    d=d/2;
    int[] sh = new int[5];
    sh[0]=a;
    sh[1]=b;
    sh[2]=c;
    sh[3]=d;
    sh[4]=e;
    int min=a;
    for(int j=1;j<5;j++){
    if(min>sh[j]){
        min=sh[j];
    }
    }
    return min;
    }
}