Maximum Number of Balloons LeetCode solution in Java

1
class Solution {
2

3
  public int maxNumberOfBalloons(String text) {
4
    return maxNumberOfWords(text, "balloon");
5
  }
6

7
  private int maxNumberOfWords(String text, String word) {
8
    final int[] tFrequencies = new int[26];
9
    for (int i = 0; i < text.length(); ++i) {
10
      tFrequencies[text.charAt(i) - 'a']++;
11
    }
12
    final int[] wFrequencies = new int[26];
13
    for (int i = 0; i < word.length(); ++i) {
14
      wFrequencies[word.charAt(i) - 'a']++;
15
    }
16
    int min = Integer.MAX_VALUE;
17
    for (int i = 0; i < 26; ++i) {
18
      if (wFrequencies[i] > 0) {
19
        final int count = (tFrequencies[i] / wFrequencies[i]);
20
        if (count < min) {
21
          min = count;
22
        }
23
      }
24
    }
25
    return min;
26
  }
27
}