LC-1422 Easy LeetCode

1422. Maximum Score After Splitting a String

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 65% Topics: String, Prefix Sum

Reading material

Strings 12 min Prefix Sums & Difference Arrays 11 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def maxScore(self, s):
        """
        :type s: str
        :rtype: int
        """
        result, zeros, ones = 0, 0, 0
        for i in xrange(1, len(s)-1):
            if s[i] == '0':
                zeros += 1
            else:
                ones += 1
            result = max(result, zeros-ones)
        return result + ones + (s[0] == '0') + (s[-1] == '1')

Solution from kamyu104/LeetCode-Solutions · MIT