feat: [LeetCode #1456] Maximum Number Of Vowels In A Substring Of Given Length (#16)

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

-

Ссылка: https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/

Author: onixlas

src/sliding_window/maximum_number_of_vowels_in_a_substring_of_given_length/__init__.py

@@ -0,0 +1,14 @@
+class Solution:
+    def maxVowels(self, s: str, k: int) -> int:
+        vowels = set("aeiou")
+        max_quantity = 0
+        current_quantity = 0
+
+        for index in range(len(s)):
+            if s[index] in vowels:
+                current_quantity += 1
+            if index >= k:
+                if s[index - k] in vowels:
+                    current_quantity -= 1
+            max_quantity = max(max_quantity, current_quantity)
+        return max_quantity

src/sliding_window/maximum_number_of_vowels_in_a_substring_of_given_length/solution.py

@@ -0,0 +1,17 @@
+import pytest
+from src.sliding_window.maximum_number_of_vowels_in_a_substring_of_given_length.solution import (
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    "s, k, expected",
+    [
+        ("abciiidef", 3, 3),
+        ("aeiou", 2, 2),
+        ("leetcode", 3, 2),
+    ],
+)
+def test_max_vowels(s, k, expected):
+    solution = Solution()
+    assert solution.maxVowels(s, k) == expected