leetcode 643. Maximum Average Subarray I

最新推荐文章于 2023-12-24 21:37:17 发布

转载最新推荐文章于 2023-12-24 21:37:17 发布 · 92 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/bonelee/p/9131255.html

本文介绍了一种算法，用于在给定长度k的情况下，从包含n个整数的数组中找到连续子数组，该子数组具有最大平均值，并输出这个最大平均值。通过迭代和滑动窗口的方法，有效地解决了这个问题。

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

class Solution(object):
    def findMaxAverage(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: float
        """
        # just iterate
        # init: s
        s = sum(nums[:k])
        ans = float(s)/k
        for i in xrange(k, len(nums)):
            s = s+nums[i]-nums[i-k]
            ans = max(ans, float(s)/k)
        return ans

转载于:https://www.cnblogs.com/bonelee/p/9131255.html