LeetCode 1422. 分割字符串的最大得分

示例 1：

输入：s = "011101"
输出：5 
解释：
将字符串 s 划分为两个非空子字符串的可行方案有：
左子字符串 = "0" 且 右子字符串 = "11101"，得分 = 1 + 4 = 5 
左子字符串 = "01" 且 右子字符串 = "1101"，得分 = 1 + 3 = 4 
左子字符串 = "011" 且 右子字符串 = "101"，得分 = 1 + 2 = 3 
左子字符串 = "0111" 且 右子字符串 = "01"，得分 = 1 + 1 = 2 
左子字符串 = "01110" 且 右子字符串 = "1"，得分 = 2 + 1 = 3
示例 2：

输入：s = "00111"
输出：5
解释：当 左子字符串 = "00" 且 右子字符串 = "111" 时，我们得到最大得分 = 2 + 3 = 5
示例 3：

输入：s = "1111"
输出：3

class Solution:
    def maxScore(self, s: str) -> int:
        sList = list(s)
        left = 1 if sList[0]=='0' else 0
        right = sList[1:].count('1')
        index = 0
        maxNum = left + right
        while index<len(sList)-2:
            index = index + 1
            if sList[index] == '0':
                left = left + 1
            else:
                right = right - 1
            maxNum = max(maxNum, left+right)
        return maxNum