No1189.java

packageAlgorithm.leetcode.String;

/**
 * 
 * Created by tujietg on Oct 24, 2019
 */
publicclassNo1189 {
publicintmaxNumberOfBalloons(Stringtext) {
inta = 0;
intb = 0;
into = 0;
intl = 0;
intn = 0;
for (inti = 0; i < text.length(); i++) {
charitem = text.charAt(i);
if (item == 'a') {
a = a + 1;
 } elseif (item == 'b') {
b++;
 } elseif (item == 'l') {
l++;
 } elseif (item == 'o') {
o++;
 } elseif (item == 'n') {
n++;
 } else {
 }
 }
l = l / 2;
o = o / 2;
intminText = 0;
minText = Math.min(a, b);
minText = Math.min(minText, l);
minText = Math.min(minText, o);
minText = Math.min(minText, n);
returnminText;
 }
}