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 = 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
Constraints:
n == nums.length1 <= k <= n <= 105-104 <= nums[i] <= 104class Solution {
public:
double findMaxAverage(vector<int>& nums, int k) {
double sum=0;
for(int i=0; i<k; i++)
sum+=nums[i];
double maxSum=sum;
for(int i=0; i<nums.size()-k; i++){
sum+=nums[i+k]-nums[i];
maxSum=max(maxSum, sum);
}
return maxSum/k;
}
};/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
var findMaxAverage = function(nums, k) {
var sum=0;
for(var i=0; i<k; i++)
sum+=nums[i];
var maxSum=sum;
for(var i=0; i<nums.length-k; i++){
sum+=nums[i+k]-nums[i];
maxSum=Math.max(maxSum, sum);
}
return maxSum/k;
};