1653. Minimum Deletions to Make String Balanced

最新推荐文章于 2024-09-09 22:01:06 发布

ZustinLau

最新推荐文章于 2024-09-09 22:01:06 发布

阅读量91

点赞数

分类专栏：動態規劃 Leetcode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_58286631/article/details/125139843

版权

Leetcode 同时被 2 个专栏收录

53 篇文章 0 订阅

订阅专栏

動態規劃

49 篇文章 0 订阅

订阅专栏

该博客讨论了一个关于数组处理的问题，即如何在遇到连续的'a'字符时，通过翻转操作使得整个数组变为'b'。算法涉及动态维护翻转次数和'b'的计数，当'a'出现次数超过'b'时，重置翻转计数，以达到最小化翻转次数的目标。解决方案提供了一个C++类`Solution`，包含一个`minimumDeletions`方法，用于计算所需的最小翻转次数。

摘要由CSDN通过智能技术生成

Same problem with monotone fliping coin.

the machanics is like this, if you encounter b in side some a, you need to flip it, so you store the times you encounter the b.

but if you find out what if the whole array is b, or a, or a or b is monopoly in this array.

we assume the now we need to make the whole array to be b. so, every time you meet a, you add the fliping times by 1.

And you also count the occurence of b, if the occurence of b smaller than the b, you reset the flip, because you know in this prefix a shows up more than b, turn b to a is cost minmum, so reset the flip.

the flip is just like a flag standing in the postion j that the last b show up and tells you that from this to the i (s[i] = b), there are fliping times of occurrence of a.

as i sad the flip is like a flag only stands at the b's position, if after the last b, there are no more b, we would increment the flip as these all a is invalid.

class Solution {
public:
    int minimumDeletions(string s) {
        int bcount =0, flip = 0;
        for(int i = 0; i < s.length(); i++){
            if(s[i] == 'b'){
                bcount++;
            }else{
                flip++;
            }
            flip = min(flip, bcount);
        }
        return flip;
    }
};