Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 346 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 346 # by problem number
lcpy gen -s moving_average_from_data_stream # by problem name
MovingAverage class:
MovingAverage(int size) Initializes the object with the size of the window size.double next(int val) Returns the moving average of the last size values of the stream.Input
["MovingAverage", "next", "next", "next", "next"]
[[3], [1], [10], [3], [5]]
Output
[null, 1.0, 5.5, 4.66667, 6.0]
Explanation
MovingAverage movingAverage = new MovingAverage(3);
movingAverage.next(1); // return 1.0 = 1 / 1
movingAverage.next(10); // return 5.5 = (1 + 10) / 2
movingAverage.next(3); // return 4.66667 = (1 + 10 + 3) / 3
movingAverage.next(5); // return 6.0 = (10 + 3 + 5) / 3
1 <= size <= 1000-10^5 <= val <= 10^510^4 calls will be made to next.from collections import deque
class MovingAverage:
# Time: O(1) per next call
# Space: O(size) — window holds at most size values
def __init__(self, size: int) -> None:
self.size = size
self.window: deque[int] = deque()
self.window_sum = 0
# Time: O(1)
# Space: O(1)
def next(self, val: int) -> float:
self.window.append(val)
self.window_sum += val
if len(self.window) > self.size:
self.window_sum -= self.window.popleft()
return self.window_sum / len(self.window)
| Time | Space |
|---|---|
| O(1) per next call | O(size) — window holds at most size values |