
[LeetCode] 1422. Maximum Score After Splitting a String (Python)
·
알고리즘/LeetCode
난이도: Easy 문제 설명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..