Problem
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.
https://leetcode.com/problems/maximum-score-after-splitting-a-string/
Example 1:
Input:
s = "011101"
Output:5
Explanation:
All possible ways of splitting s into two non-empty substrings are:
left = "0"
andright = "11101"
,score = 1 + 4 = 5
left = "01"
andright = "1101"
,score = 1 + 3 = 4
left = "011"
andright = "101"
,score = 1 + 2 = 3
left = "0111"
andright = "01"
,score = 1 + 1 = 2
left = "01110"
andright = "1"
,score = 2 + 1 = 3
Example 2:
Input:
s = "00111"
Output:5
Explanation: Whenleft = "00"
andright = "111"
, we get the maximumscore = 2 + 3 = 5
Example 3:
Input: s = "1111"
Output: 3
Constraints:
2 <= s.length <= 500
- The string
s
consists of characters'0'
and'1'
only.
Test Cases
1 | class Solution: |
1 | import pytest |
Thoughts
设 s 中一个有 one 个 '1'
。从左到右遍历字符串,记录 '0'
和 '1'
的个数,设分别为 zero1 和 one1。那么 zero1 + (one - one1)
就是此时的 score。取最大的即可。
Code
1 | class Solution: |