Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window.
Implement the MovingAverage
class:
MovingAverage(int size)
Initializes the object with the size of the windowsize
.double next(int val)
Returns the moving average of the lastsize
values of the stream.
Example 1:
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
Constraints:
1 <= size <= 1000
-105 <= val <= 105
- At most
104
calls will be made tonext
.
class MovingAverage:
def __init__(self, size: int):
"""
Initialize your data structure here.
"""
self.size = size
self.data = [0] * size
self.count = 0
self.s = 0
def next(self, val: int) -> float:
idx = self.count % self.size
old_val = self.data[idx]
self.data[idx] = val
self.s += (val - old_val)
self.count += 1
return self.s / min(self.size, self.count)
# Your MovingAverage object will be instantiated and called as such:
# obj = MovingAverage(size)
# param_1 = obj.next(val)
class MovingAverage {
private int size;
private int[] data;
private int count;
private int s;
/** Initialize your data structure here. */
public MovingAverage(int size) {
this.size = size;
this.data = new int[size];
}
public double next(int val) {
int idx = count % size;
int oldVal = data[idx];
data[idx] = val;
s += (val - oldVal);
++count;
return s * 1.0 / Math.min(size, count);
}
}
/**
* Your MovingAverage object will be instantiated and called as such:
* MovingAverage obj = new MovingAverage(size);
* double param_1 = obj.next(val);
*/