643. Maximum Average Subarray I 最大平均子数组

Given an array consisting of n integers, find the contiguous subarray of given lengthk that has the maximum average value. And you need to output the maximum average value.

Example 1:

Input: [1,12,-5,-6,50,3], k = 4Output: 12.75Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75

Note:

1. 1 <= k <= n <= 30,000.
2. Elements of the given array will be in the range [-10,000, 10,000].

---

class Solution {    public double findMaxAverage(int[] nums, int k) {        if(nums==null||nums.length<k||k==0)return 0;        int num=0;        for(int i=0;i<k;i++){            num+=nums[i];        }        int result=num;        for(int i=k;i<nums.length;i++){            num+=nums[i]-nums[i-k];            result=Math.max(result, num);        }        return result/1.0/k;    }}

题目解释：要求计算出整个数组中给定长度k的k个元素的最大平均值

解决思路：其实就是将所有给定相邻k个数组的数值进行平均值计算