class Solution {
public double findMaxAverage(int[] nums, int k) {
int sum=0;
for(int i=0;i<k;i++) sum+=nums[i];
int max=sum;
for(int i=k;i<nums.length;i++){
sum+=nums[i]-nums[i-k];
max=Math.max(max,sum);
}
return (max+0.0)/k ;
}
}
leetcode 643 Maximum Average Subarray I
最新推荐文章于 2024-09-14 18:46:05 发布