描述
Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty substrings (i.e. left substring and right substring).
The score after splitting a string is the number of zeros in the left substring plus the number of ones in the right substring.
Example 1:
Input: s = "011101"
Output: 5
Explanation:
All possible ways of splitting s into two non-empty substrings are:
left = "0" and right = "11101", score = 1 + 4 = 5
left = "01" and right = "1101", score = 1 + 3 = 4
left = "011" and right = "101", score = 1 + 2 = 3
left = "0111" and right = "01", score = 1 + 1 = 2
left = "01110" and right = "1", score = 2 + 1 = 3
Example 2:
Input: s = "00111"
Output: 5
Explanation: When left = "00" and right = "111", we get the maximum score = 2 + 3 = 5
Example 3:
Input: s = "1111"
Output: 3
Note:
2 <= s.length <= 500
The string s consists of characters '0' and '1' only.
解析
根据题意，就是将 s 分成左右两部分后，左边的 0 的个数和右边 1 的个数的最大和。思路简单，先统计出所有的 1 的个数，然后遍历 s 的前 n-1 个字符，如果字符为 0 则 zeros 加一，否则 ones 减一，然后将比较 score 和 ones + zeros 较大值为 score ，循环结束得到的 score 就是答案。
解答
class Solution(object):
def maxScore(self, s):
"""
:type s: str
:rtype: int
"""
score = 0
zeros = 0
ones = s.count('1')
for i in range(len(s)-1):
if s[i] == '0':
zeros += 1
else:
ones -= 1
score = max(score, ones + zeros)
return score
运行结果
Runtime: 16 ms, faster than 94.77% of Python online submissions for Maximum Score After Splitting a String.
Memory Usage: 13.4 MB, less than 65.70% of Python online submissions for Maximum Score After Splitting a String.
原题链接：leetcode.com/problems/ma…
您的支持是我最大的动力
