Maximum Score After Splitting a String

lcpy gen -n 1422   # by problem number
lcpy gen -s maximum_score_after_splitting_a_string   # by problem name

Input: s = "011101"
Output: 5

Input: s = "00111"
Output: 5

Input: s = "1111"
Output: 3

class Solution:
    # Time: O(n)
    # Space: O(1)
    def max_score(self, s: str) -> int:
        left_zeros = 1 if s[0] == "0" else 0
        right_ones = s[1:].count("1")
        best = left_zeros + right_ones
        for ch in s[1:-1]:
            if ch == "0":
                left_zeros += 1
            else:
                right_ones -= 1
            best = max(best, left_zeros + right_ones)
        return best