https://leetcode-cn.com/problems/maximum-average-subarray-i/
重拳出击easy
class Solution {
public double findMaxAverage(int[] nums, int k) {
int len=nums.length;
double dp=0;
for(int i=0;i<k;i++){
dp+=nums[i];
}
if(len==1){
return dp/k;
}
double max=dp;
for(int i=1;i<=len-k;i++){
dp=dp-nums[i-1]+nums[i+k-1];
max=Math.max(max,dp);
}
return max/k;
}
}