1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
maximum-average-subarray-ii.py 910 Bytes
一键复制 编辑 原始数据 按行查看 历史
# Time: O(n)
# Space: O(n)
class Solution(object):
def findMaxAverage(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: float
"""
def getDelta(avg, nums, k):
accu = [0.0] * (len(nums) + 1)
minval_pos = None
delta = 0.0
for i in xrange(len(nums)):
accu[i+1] = nums[i] + accu[i] - avg
if i >= (k-1):
if minval_pos == None or accu[i-k+1] < accu[minval_pos]:
minval_pos = i-k+1
if accu[i+1] - accu[minval_pos] >= 0:
delta = max(delta, (accu[i+1] - accu[minval_pos]) / (i+1 - minval_pos))
return delta
left, delta = min(nums), float("inf")
while delta > 1e-5:
delta = getDelta(left, nums, k)
left += delta
return left
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助