8.31 练手 腾讯50题 643

Leetcode 643. Maximum Average Subarray I

Given an array consisting of n integers, find the contiguous subarray of given length kthat 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].

使用动态规划来解的，想法是在数组的第i位时获得的avg增益最大。

代码如下：

class Solution:
    def findMaxAverage(self, nums: List[int], k: int) -> float:
    	M = d = 0
    	for i in range(len(nums)-k):
    		d += nums[i+k] - nums[i]
    		if d > M: M = d
    	return (sum(nums[:k])+M)/k

代码不是我的版本，但是思路是相似的，我觉得这个比较简单明了所以直接用了。