D. J.:

- Added the leetcode problem and solution for 643

Author: nobodyPerfecZ

README.md

@@ -239,6 +239,7 @@
 - [518 Coin Change II](https://leetcode.com/problems/coin-change-ii/description/)
 - [530 Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/description/)
 - [637 Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/description/)
+- [643 Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/description/)
 - [646 Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/description/)
 - [673 Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence/description/)
 - [712 Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/description/)

awesome_python_leetcode/_643_maximum_average_subarray_I.py

@@ -0,0 +1,24 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def findMaxAverage(self, nums: List[int], k: int) -> float:
+        """
+        You are given an integer array nums consisting of n elements, and an integer k.
+
+        Find a contiguous subarray whose length is equal to k that has the maximum
+        average value and return this value. Any answer with a calculation error less
+        than 10-5 will be accepted.
+        """
+        max_average = nums[0]
+        average = nums[0]
+        for left in range(len(nums) - k + 1):
+            if left:
+                average = average - nums[left - 1] + nums[left + k - 1]
+                max_average = max(max_average, average)
+            else:
+                average = sum(nums[left : left + k])
+                max_average = sum(nums[left : left + k])
+        return max_average / k

tests/test_643_maximum_average_subarray_I.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._643_maximum_average_subarray_I import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "k", "expected"],
+    argvalues=[
+        ([1, 12, -5, -6, 50, 3], 4, 12.75),
+        ([5], 1, 5.0),
+    ],
+)
+def test_func(nums: List[int], k: int, expected: float):
+    """Tests the solution of a LeetCode problem."""
+    max_average = Solution().findMaxAverage(nums, k)
+    assert max_average == expected