class Solution {
public double findMaxAverage(int[] nums, int k) {
int n = nums.length;
double res=0,t;
int sum = 0;
for(int i = 0;i<k;i++){
sum+=nums[i];
}
res = (double)sum/k;
for(int i=k;i<n;i++){
sum-=nums[i-k];
sum+=nums[i];
t = (double) sum/k;
res = Math.max(res,t);
}
return res;
}
}
leetcode643. 子数组最大平均数 I
最新推荐文章于 2024-06-12 10:00:23 发布