643. maximum average subarray i

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.

Example 1:

1
2
3
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
1
2
3
4
5
6
7
8
9
10
11
12
13
14
class  {
public double findMaxAverage(int[] nums, int k) {
int max = 0;
for (int i = 0; i < k; i++) {
max += nums[i];
}
int sum = max;
for (int l = 0, r = k; r < nums.length; l++, r++) {
sum += nums[r] - nums[l];//每前进增加一个,去掉头部一个,得出一个新的和
max = Math.max(max, sum);//比较最大值和新的值哪个大
}
return (double)max / k;
}
}