LeetCode刷题【Array】 Maximum Average Subarray I

最新推荐文章于 2024-01-03 19:30:38 发布

SimonCode

最新推荐文章于 2024-01-03 19:30:38 发布

阅读量390

点赞数

分类专栏： LeetCode 文章标签： Array leetcode

本文链接：https://blog.csdn.net/ltxiaoxia/article/details/75335090

版权

LeetCode 专栏收录该内容

49 篇文章 0 订阅

订阅专栏

【题目】

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 <= k <= n <= 30,000.
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