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 <= k <= n <= 30,000.
Elements of the given array will be in the range [-10,000, 10,000].

本题题意很简单，直接使用滑动窗口去做即可

代码如下:

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <numeric>
#include <cmath>
#include <regex>

using namespace std;


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