Maximum Average Subarray I

Maximum Average Subarray I

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.

Examples

Example 1:

Input: nums = [1, 12, -5, -6, 50, 3], k = 4
Output: 12.75
Explanation: Maximum average is (12 + (-5) + (-6) + 50) / 4 = 51 / 4 = 12.75

Example 2:

Input: nums = [5], k = 1
Output: 5.0

Example 3:

Input: nums = [0, 4, 0, 3, 2], k = 1
Output: 4.0
Explanation: When k = 1, the maximum average subarray is the single maximum element.

Constraints

• n == nums.length
• 1 <= k <= n <= 10^5
• -10^4 <= nums[i] <= 10^4

Expected Complexity

• Time: O(n)
• Space: O(1)