LeetCode-643. Maximum Average Subarray I

Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the maximum average value.

Example 1:

Input: [1,12,-5,-6,50,3], k = 4
Output: 12.75
Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75

Note:

1. 1 <= k <= n <= 30,000.
2. Elements of the given array will be in the range [-10,000, 10,000].

题解：

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