#1422
Maximum Score After Splitting a String
pupil · 330 · lc easy +22 · verified · 65.1% accepted · 2,188 likes · top 69%
Description
Given a binary string s (containing only '0' and '1'), split it into two non-empty parts. The score is the number of '0's in the left part plus the number of '1's in the right part. Return the maximum possible score.
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
Code
1
2
3