程式語言 - LeetCode - C++ - 643. Maximum Average Subarray I

參考資訊：
https://www.cnblogs.com/cnoodle/p/14375730.html

題目：


解答：

class Solution {
public:
    double findMaxAverage(vector<int>& nums, int k) {
        int r = -INT_MAX;
        int sum = 0;

        for (int i = 0; i < nums.size(); i++) {
            sum += nums[i];

            if (i >= (k - 1)) {
                if (sum > r) {
                    r = sum;
                }
                sum -= nums[i - (k - 1)];
            }
        }

        return (double)r / k;
    }
};