LeetCode:643. 子数组最大平均数 I
简单的滑动窗口
双指针
AC Code
class Solution {
public double findMaxAverage(int[] nums, int k) {
double ans = -10007;
int left = 0, right = 0, len = nums.length, sum = 0;
while(right < k) sum += nums[right++];
while(right <= len) {
ans = Math.max(ans, (double)sum / (double)k);
if(right == len) break;
sum -= nums[left++];
sum += nums[right++];
}
return ans;
}
}