Leetcode—2609.最长平衡子字符串【简单】

news2024/11/24 3:52:02

2023每日刷题（二十三）

Leetcode—2609.最长平衡子字符串

在这里插入图片描述

实现代码

class Solution {
public:
    int findTheLongestBalancedSubstring(string s) {
        int zeros = 0;
        int ones = 0;
        int ans = 0;
        int n = s.size();
        for(int i = 0; i < n; i++) {
            int t = s[i] - '0';
            if(t == 0) {
                zeros++;
            }
            if(t == 1 && zeros) {
                if(ones <= zeros) {
                    ones++;
                }
            }
            if(i < n && (s[i + 1] - '0') == 0 && (s[i] - '0') == 1) {
                int tmp = ones > zeros ? zeros : ones;
                ans = ans > tmp ? ans : tmp;
                zeros = 0;
                ones = 0;
            }
            if(i == n - 1 && (s[i] - '0') == 1) {
                int tmp = ones > zeros ? zeros : ones;
                ans = ans > tmp ? ans : tmp;
                zeros = 0;
                ones = 0;
            }
        }
        ans *= 2;
        return ans;
    }
};

运行结果

在这里插入图片描述

分界思路的实现代码

class Solution {
public:
    int findTheLongestBalancedSubstring(string s) {
        int ans = 0;
        int pre = 0;
        int cur = 0;
        int n = s.size();
        for(int i = 0; i < n; i++) {
            cur++;
            if(i + 1 == n || s[i] != s[i + 1]) {
                if(s[i] == '1') {
                    ans = max(ans, min(pre, cur) * 2);
                }
                pre = cur;
                cur = 0;
            }
        }
        return ans;
    }
};