2609. 最长平衡子字符串

题意

题目链接
计算最长连续0+连续1且个数相等的子串

思路

计算

代码

class Solution {
public:
    int findTheLongestBalancedSubstring(string s) {
        int ans = 0;
        int a = 0, b = 0;
        for (auto &it : s)
        {
            if (it == '0')
            {
                if (!b)
                    a++;
                else
                {
                    ans = max(ans, 2 * min(a, b));
                    a = 1;
                    b = 0;
                }
            }
            else
            {
                b++;
                ans = max(ans, 2 * min(a, b));
            }
      //      cout << a << " " << b << endl;
        }
        return ans;
    }
};