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:

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

Note:

1. 1 <= k <= n <= 30,000.

1. Elements of the given array will be in the range [-10,000, 10,000].

题意：

给出一个数组，求长度为k的子数组的最大平均值。

思路：

先求出nums[0]+……+nums[k-1]，数组a表示各长度为k的子数组之和，可以得到 a[i]=a[i-1]+nums[k+i-1]-nums[i-1];再求a的最大值即可。可以降低时间复杂度，只需O(n)，而不需要两个嵌套的for循环。

代码：

class Solution {
public:
    double findMaxAverage(vector<int>& nums, int k) {
        double a[30001],maxn=0.0;
        for(int i=0;i<k;i++)
            maxn+=nums[i];
        a[0]=maxn;
        for(int i=1;i+k-1<nums.size();i++)
        {
            a[i]=a[i-1]+nums[k+i-1]-nums[i-1];
            if(a[i]>maxn)
                maxn=a[i];
        }
        return (maxn/k);
    }
};