# LeetCode - 0643. Maximum Average Subarray I
### 題目網址：https://leetcode.com/problems/maximum-average-subarray-i/
###### tags: `LeetCode` `Easy` `窮舉`

/*
    -LeetCode format-
    Problem: 643. Maximum Average Subarray I
    Difficulty: Easy
    
    by Inversionpeter
*/



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