[Leetcode]643. Maximum Average Subarray I

最新推荐文章于 2025-02-03 15:37:10 发布

Nicole852217677

最新推荐文章于 2025-02-03 15:37:10 发布

阅读量106

点赞数

原文链接：http://www.cnblogs.com/David-Lin/p/7874435.html

版权

本文介绍了一种算法，用于在给定长度的连续子数组中找到具有最大平均值的子数组，并详细解释了其实现过程。通过将每K个连续元素视为一个整体并逐步移动，比较这些元素的总和与当前最大总和，从而找到最大平均值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

思路：把数组里每 K 个连续

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