_487. Max Consecutive Ones II.md

487. Max Consecutive Ones II

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : February 22, 2025

Last updated : February 22, 2025

---

Related Topics : Array, Dynamic Programming, Sliding Window

Acceptance Rate : 51.34 %

---

Solutions

• m487.py

Python

m487.py

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        ones = [0]
        consec_ones = 0

        for num in nums :
            if num == 0 :
                if consec_ones :
                    ones.append(consec_ones)
                ones.append((consec_ones := 0))
            else :
                consec_ones += 1
        ones.append(consec_ones)

        return max([sum(ones[x - 1:x+2]) + abs(min(ones[x], 1) - 1)
                    for x in range(1, len(ones) - 1)] + ones)