643. Maximum Average Subarray I

Problem Description:

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

Analysis:

本题的思路是首先将前k个数相加，最后在一一的删减，但是选取其中最大的一个数。代码如下：

Code:

class Solution {
    public double findMaxAverage(int[] nums, int k) {
        if(k < 1)
            return 0.0;
        int sumValue = 0;
        for(int i = 0; i < Math.min(nums.length, k); i++) {
            sumValue += nums[i];
        }
        int resultValue = sumValue;
        int j = 0;
        for(int i = k; i < nums.length; i++) {
            sumValue += nums[i];
            sumValue -= nums[j++];
            resultValue = Math.max(resultValue, sumValue);
        }
        return (double)resultValue/k;
    }
}