Maximum Average Subarray I

·#643·Easy·Sliding Window

Fixed window of size k · find maximum average value

Practice mode

Try your own input

Change the array and replay the algorithm from step one.

Step

Current step

Find the contiguous subarray of length k = 4 with the maximum average.

Array workspace

Sliding Window

Step 1 / 13init

100%

-5

-6

[0]

[1]

[2]

[3]

[4]

[5]

step 1 / 13

Space play← → stepHome reset

TimeO(n)·SpaceO(1)

Sliding Window

1function findMaxAverage(nums, k) {//n: 6k: 4windowSum: —maxSum: —
2  let windowSum = 0;
3  for (let i = 0; i < k; i++) {
4    windowSum += nums[i];
5  }
6  let maxSum = windowSum;
7  for (let i = k; i < nums.length; i++) {
8    windowSum = windowSum - nums[i - k] + nums[i];
9    maxSum = Math.max(maxSum, windowSum);
10  }
11  return maxSum / k;
12}

windowSum—

maxSum—

Command Palette

Maximum Average Subarray I

Maximum Average Subarray I