1422. Maximum Score After Splitting a String 链接到标题 求出左侧 0 数量和右侧 1 数量之和最多的情况，遍历一次，每次更新最大值，注意要保证字符串始终被切分为 2 个子字符串。class Solution: def maxScore(self, s: str) -> int: right = s.count('1') left = 0 score = 0 for idx in range(len(s) - 1): if s[idx] == '1': score = max(score, (left + right - 1)) right -= 1……