LeetCode 643. Maximum Average Subarray I

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].

---

题目大意:

给定一个数组，和一个数字k，找出连续k个数的最大平均数是多少。我们只要找出连续k个数的最大和。
这里给出两种做法:
1.第一种是使用双向队列deque，当作能存放三个元素的窗口在数组上滑动，寻找最大和。
2.利用前n项和，可以求出所有的k个数的连续子序列的和。

---

题目代码:

class Solution {
public:
    double findMaxAverage(vector<int>& nums, int k) {
        deque<int> dq;
        double curSum = 0, maxSum = INT_MIN;
        for(int i = 0; i < nums.size(); i++){
            dq.push_back(nums[i]);
            curSum+=nums[i];
            if(dq.size() > k){
                curSum -= dq.front();
                dq.pop_front();
            }
            if(dq.size() == k)
                maxSum = max(maxSum, curSum);
        }
        return maxSum / k;
    }
};

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