问题描述:
Given an array consisting of n
integers, find the contiguous subarray of given length k
that has the maximum average value. And you need to output the maximum average value.
示例:
Input: [1,12,-5,-6,50,3], k = 4 Output: 12.75 Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75
问题分析:
求连续子数组的平均值,可采取滑动窗口法,求得子数组的最大和,然后取平均值即可。
过程详见代码:
class Solution {
public:
double findMaxAverage(vector<int>& nums, int k) {
int sum = 0;
int maxSum = 0;
int i = 0;
for (; i < k; i++)
{
sum += nums[i];
}
maxSum = sum;
for (; i < nums.size(); i++)
{
sum = sum - nums[i - k] + nums[i];
maxSum = max(maxSum, sum);
}
return (double)maxSum / k;
}
};