3499. Maximize Active Section with Trade I

class Solution {
    public int maxActiveSectionsAfterTrade(String s) {
        int n = s.length();
        int ones = 0;
        int maxMerge = 0;
        int prevZeroBlock = Integer.MIN_VALUE;
        int i = 0;
        while (i < n) {
            int j = i;
            while (j < n && s.charAt(j) == s.charAt(i)) {
                j++;
            }
            int len = j - i;
            if (s.charAt(i) == '1') {
                ones += len;
            } else {
                maxMerge = Math.max(maxMerge, prevZeroBlock + len);
                prevZeroBlock = len;
            }
            i = j;
        }
        return ones + maxMerge;
    }
}

class Solution:
    def maxActiveSectionsAfterTrade(self, s: str) -> int:
        n = len(s)
        ones = 0
        max_merge = 0
        prev_zero_block = float("-inf")
        i = 0

        while i < n:
            j = i
            while j < n and s[j] == s[i]:
                j += 1

            length = j - i

            if s[i] == '1':
                ones += length
            else:
                max_merge = max(max_merge, prev_zero_block + length)
                prev_zero_block = length

            i = j

        return ones + max_merge

class Solution {
public:
    int maxActiveSectionsAfterTrade(string s) {
        int n = s.size();
        int ones = 0;
        int maxMerge = 0;
        int prevZeroBlock = INT_MIN;
        int i = 0;

        while (i < n) {
            int j = i;
            while (j < n && s[j] == s[i]) {
                j++;
            }

            int len = j - i;

            if (s[i] == '1') {
                ones += len;
            } else {
                maxMerge = max(maxMerge, prevZeroBlock + len);
                prevZeroBlock = len;
            }

            i = j;
        }

        return ones + maxMerge;
    }
};

var maxActiveSectionsAfterTrade = function(s) {
    const n = s.length;
    let ones = 0;
    let maxMerge = 0;
    let prevZeroBlock = Number.MIN_SAFE_INTEGER;
    let i = 0;

    while (i < n) {
        let j = i;
        while (j < n && s[j] === s[i]) {
            j++;
        }

        const len = j - i;

        if (s[i] === '1') {
            ones += len;
        } else {
            maxMerge = Math.max(maxMerge, prevZeroBlock + len);
            prevZeroBlock = len;
        }

        i = j;
    }

    return ones + maxMerge;
};