LC-2155 Medium LeetCode

2155. All Divisions With the Highest Score of a Binary Array

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 64% Topics: Array

Reading material

Reference solution (spoiler · python)

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

# prefix sum
class Solution(object):
    def maxScoreIndices(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        result = []
        mx = zeros = 0
        total = sum(nums)
        for i in xrange(len(nums)+1):
            zeros += ((nums[i-1] if i else 0) == 0)
            if zeros+(total-(i-zeros)) > mx:
                mx = zeros+(total-(i-zeros))
                result = []
            if zeros+(total-(i-zeros)) == mx:
                result.append(i)
        return result

Solution from kamyu104/LeetCode-Solutions · MIT