LeetCode 643. 子数组最大平均数 I

滑动窗口月简单题，没什么好说的，标记遍历对比即可；

 

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