leetcode+ 固定区间长和平均最大,固定窗口,然后滑动。

点击打开链接
class Solution {
public:
    double findMaxAverage(vector<int>& nums, int k) {
        int maxSum =0 , sum =0;
        for(int i=0; i<k;i++){
            sum+=nums[i];
        }
        maxSum = sum;
        for(int l=0, r=k; r<nums.size(); l++, r++){
            sum += nums[r] - nums[l];
            maxSum = max(maxSum, sum);
        }
        return double(maxSum)/k;
    }
};

猜你喜欢

转载自blog.csdn.net/u013554860/article/details/80698953