题目
给定一个整数数据流和一个窗口大小,根据该滑动窗口的大小,计算其所有整数的移动平均值。
实现 MovingAverage
类:
MovingAverage(int size)
用窗口大小size
初始化对象。double next(int val)
计算并返回数据流中最后size
个值的移动平均值。
示例:
输入:
["MovingAverage", "next", "next", "next", "next"]
[[3], [1], [10], [3], [5]]
输出:
[null, 1.0, 5.5, 4.66667, 6.0]
解释:
MovingAverage movingAverage = new MovingAverage(3);
movingAverage.next(1); // 返回 1.0 = 1 / 1
movingAverage.next(10); // 返回 5.5 = (1 + 10) / 2
movingAverage.next(3); // 返回 4.66667 = (1 + 10 + 3) / 3
movingAverage.next(5); // 返回 6.0 = (10 + 3 + 5) / 3
提示:
1 <= size <= 1000
-105 <= val <= 105
- 最多调用
next
方法104
次
思路
- 使用一个队列保存窗口内的值
- 并使用一个变量计算当前的总和,以避免每一次求平均值都要重复计算
代码
from collections import deque
class MovingAverage:
def __init__(self, size: int):
"""
Initialize your data structure here.
"""
self.capacity = size
self.queue = deque()
self.sum = 0
self.last = 0
def next(self, val: int) -> float:
if len(self.queue)< self.capacity:
self.sum += val
else:
self.sum += val - self.queue.popleft()
self.queue.append(val)
return self.sum / len(self.queue)
# Your MovingAverage object will be instantiated and called as such:
# obj = MovingAverage(size)
# param_1 = obj.next(val)
复杂度
- 时间复杂度
- init: O ( 1 ) O(1) O(1)
- next: O ( 1 ) O(1) O(1)
- 空间复杂度:
- init: O ( 1 ) O(1) O(1)
- next: O ( n ) O(n) O(n)