Minimum Deletions to Make String Balanced LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minimumDeletions(string s) {
4
    vector<int> deletions(s.size() + 1, 0);
5
    int b_count = 0;
6

7
    for (int i = 0; i < s.size(); i++) {
8
      if (s[i] == 'a') {
9
        // Either Delete this 'a' or Delete all previous 'b's.
10
        deletions[i + 1] = min(deletions[i] + 1, b_count);
11
      } else {
12
        deletions[i + 1] = deletions[i];
13
        b_count++;
14
      }
15
    }
16

17
    return deletions[s.size()];
18

19
    // The code is contributed by Mufaddal Saifuddin
20
  }
21
};