LeetCode--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.
2. Elements of the given array will be in the range [-10,000, 10,000].

---

题意：给定一个数组和整数k，求数组中最大的连续k个数，输出其平均值。

思路：

1.直接遍历，每次求得当前的连续k个数之和，并记录最大值。

参考代码：

class Solution {
public:
    double findMaxAverage(vector<int>& nums, int k) {
        double temp=0,sum=0;
        for(int i=0;i<k;++i) temp+=nums[i];
        sum=temp;
        for(int i=k;i<nums.size();++i){
            temp=temp+nums[i]-nums[i-k];
            sum=max(sum,temp);
        }
        return sum/k;
    }
};