给定一个整数数据流和一个窗口大小,根据该滑动窗口的大小,计算滑动窗口里所有数字的平均值。
实现 MovingAverage
类:
MovingAverage(int size)
用窗口大小size
初始化对象。double next(int val)
成员函数next
每次调用的时候都会往滑动窗口增加一个整数,请计算并返回数据流中最后size
个值的移动平均值,即滑动窗口里所有数字的平均值。
示例:
输入: inputs = ["MovingAverage", "next", "next", "next", "next"] inputs = [[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
次
注意:本题与主站 346 题相同: https://leetcode-cn.com/problems/moving-average-from-data-stream/
“循环数组/队列”实现。
class MovingAverage:
def __init__(self, size: int):
"""
Initialize your data structure here.
"""
self.size = size
self.data = [0] * size
self.sum = 0
self.count = 0
def next(self, val: int) -> float:
idx = self.count % self.size
old_val = self.data[idx]
self.data[idx] = val
self.sum += val - old_val
self.count += 1
return self.sum / min(self.count, self.size)
# 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 sum;
private int count;
/** 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;
sum += val - oldVal;
++count;
return sum * 1.0 / Math.min(count, size);
}
}
/**
* Your MovingAverage object will be instantiated and called as such:
* MovingAverage obj = new MovingAverage(size);
* double param_1 = obj.next(val);
*/
class MovingAverage {
public:
/** Initialize your data structure here. */
MovingAverage(int size) {
this->size = size;
data.resize(size);
}
double next(int val) {
int idx = count % size;
int oldVal = data[idx];
data[idx] = val;
sum += val - oldVal;
++count;
return (double) sum / min(count, size);
}
private:
int size = 0;
vector<int> data;
int sum = 0;
int count = 0;
};
/**
* Your MovingAverage object will be instantiated and called as such:
* MovingAverage* obj = new MovingAverage(size);
* double param_1 = obj->next(val);
*/
type MovingAverage struct {
size int
data []int
sum int
count int
}
/** Initialize your data structure here. */
func Constructor(size int) MovingAverage {
return MovingAverage{
size: size,
data: make([]int, size),
sum: 0,
count: 0,
}
}
func (this *MovingAverage) Next(val int) float64 {
idx := this.count % this.size
oldVal := this.data[idx]
this.data[idx] = val
this.sum += val - oldVal
this.count++
return float64(this.sum) / float64(min(this.count, this.size))
}
func min(a, b int) int {
if a < b {
return a
}
return b
}
/**
* Your MovingAverage object will be instantiated and called as such:
* obj := Constructor(size);
* param_1 := obj.Next(val);
*/