Force buckle 1189 Maximum number of "balloons"

subject ：

 

analysis ：

First of all, you should count all the times of the relevant letters of the balloon word , Then we found that in this word ,l and o It appears twice , The others only appeared once , So we divide them 2 Rounding down , Then find out the minimum value of five words .

Code ：

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