LeetCode 643. 子数组最大平均数 I(滑动窗口)

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