Maximum Average Subarray I LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @param {number} k
4
 * @return {number}
5
 */
6
var findMaxAverage = function (nums, k) {
7
  let avr = -Infinity;
8
  let windowSum = 0;
9
  let windowStart = 0;
10

11
  for (let windowEnd = 0; windowEnd < nums.length; windowEnd++) {
12
    windowSum += nums[windowEnd];
13

14
    if (windowEnd - windowStart + 1 === k) {
15
      avr = Math.max(avr, windowSum / k);
16
      windowSum -= nums[windowStart];
17
      windowStart += 1;
18
    }
19
  }
20

21
  return avr;
22
};