Leetcode - Maximum Score After Splitting a String

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

func maxScore(s string) int {
    count0 := 0
    count1 := 0
    for i := 0; i < len(s); i++ {
        if s[i] == '0' {
            count0++
        }
        if s[i] == '1' {
            count1++
        }
    }
    if count0 == len(s) || count1 == len(s) {
        return len(s)-1
    }
    curr0 := 0
    curr1 := 0
    maxNum := 0
    for i := 0; i < len(s)-1; i++ {
        if s[i] == '0' {
            curr0++
        }
        if s[i] == '1' {
            curr1++
        }
        maxNum = max(maxNum, curr0 + count1 - curr1)
    }
    return maxNum
}

func max(a, b int) int {
    if a > b {
        return a
    }
    return b
}

• 相关文章
• 全局相关文章