Minimum Deletions to Make String Balanced LeetCode solution in Java

1
class Solution {
2
  public int minimumDeletions(String s) {
3
    // ideal case : bbbbbbbbb
4
    int[] dp = new int[s.length() + 1];
5
    int idx = 1;
6
    int bCount = 0;
7

8
    for (int i = 0; i < s.length(); i++) {
9
      if (s.charAt(i) == 'a') {
10
        dp[idx] = Math.min(dp[idx - 1] + 1, bCount);
11
      } else {
12
        dp[idx] = dp[idx - 1];
13
        bCount++;
14
      }
15

16
      idx++;
17
    }
18
    return dp[s.length()];
19
  }
20
}