643. Maximum Average Subarray I

題目

643. Maximum Average Subarray I

解題思路

遍歷找出連續k個和最大的數字，最後返回和/k即可。這道題目思路簡單。

具體代碼

class Solution {
public:
    double findMaxAverage(vector<int>& nums, int k) {
        double maxsum = 0;
        for (int i = 0; i < k; i++)
            maxsum += nums[i];
        int sum = maxsum;
        for (int i = 1; i < nums.size() - k + 1; i++) {
            sum += nums[i+k-1] - nums[i-1];
            maxsum = sum > maxsum ? sum : maxsum;
        }

        return maxsum / k;
    }
};