feat: [LeetCode #1004] Max Consecutive Ones Iii

Тип: sliding-window
Сложность: medium
Временная сложность: O(n)
Пространственная сложность: O(1)

-

Ссылка: https://leetcode.com/problems/max-consecutive-ones-iii/

Author: onixlas

src/sliding_window/max_consecutive_ones_iii/__init__.py

@@ -0,0 +1,20 @@
+from typing import List
+
+
+class Solution:
+    def longestOnes(self, nums: List[int], k: int) -> int:
+        left = 0
+        max_length = 0
+        zero_counter = 0
+
+        for index in range(len(nums)):
+            if nums[index] == 0:
+                zero_counter += 1
+            while zero_counter > k:
+                if nums[left] == 0:
+                    zero_counter -= 1
+                left += 1
+
+            max_length = max(max_length, index - left + 1)
+
+        return max_length

src/sliding_window/max_consecutive_ones_iii/solution.py

@@ -0,0 +1,14 @@
+import pytest
+from src.sliding_window.max_consecutive_ones_iii.solution import Solution
+
+
+@pytest.mark.parametrize(
+    "nums, k, expected",
+    [
+        ([1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0], 2, 6),
+        ([0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1], 3, 10),
+    ],
+)
+def test_longest_ones(nums, k, expected):
+    solution = Solution()
+    assert solution.longestOnes(nums, k) == expected