Leetcode•Aug 14, 2025
Maximum Average Subarray I
Hazrat Ali
Leetcode
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.
Example 1:
Input: nums = [1,12,-5,-6,50,3], k = 4 Output: 12.75000 Explanation: Maximum average is (12 - 5 - 6 + 50) / 4 = 51 / 4 = 12.75
Example 2:
Input: nums = [5], k = 1 Output: 5.00000
Solution
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
const findMaxAverage = (nums, k) => {
let sum = 0;
let max = -Infinity;
for (let i = 0; i < nums.length; i++) {
sum += nums[i];
if (i >= k - 1) {
max = Math.max(max, sum / k);
sum -= nums[i - k + 1];
}
}
return max;
};