LeetCode刷题【Array】 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 = 4Output: 12.75Explanation: 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].

解决方法一：

public class Solution {    public double findMaxAverage(int[] nums, int k) {        if(nums==null) return 0.0;        double sum=0.0;        for(int i=0;i<k;i++){            sum+=nums[i];        }        double cursum=sum;        for(int i=1;i<nums.length-k+1;i++){            cursum=cursum-nums[i-1]+nums[i+k-1];            if(sum<cursum){                sum=cursum;            }        }        return sum/k;    }}

【参考】

https://leetcode.com/problems/maximum-average-subarray-i/#/description