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.
Example 1
Input
nums = [1,12,-5,-6,50,3], k = 4Output
12.75Maximum average is (12 - 5 - 6 + 50) / 4 = 51 / 4 = 12.75.
Example 2
Input
nums = [5], k = 1Output
5The only contiguous subarray of length 1 is [5], so the maximum average is 5.0.
Constraints
- n == nums.length
- 1 <= k <= n <= 10^5
- -10^4 <= nums[i] <= 10^4