1、题目描述
2、解题思路
看到滑动窗口,首先考虑双端队列 Dequeue
1、定义三个变量:dequeue、size 和 sum。分别表示双端队列、窗口大小、上一个平均值。
2、调用 next 时,输入为 val,先判断当前 dequeue 的容量:
2.1 如果 dequeue.size() < size,说明窗口还没满,元素直接插入;
2.2 如果 size == dequeue.size(),说明窗口已经满了,现在需要剔除头元素,末尾插入新元素;
3、解题代码
class MovingAverage {
/** Initialize your data structure here. */
private Deque<Integer> deque;
private int size;
private double sum;
/**
* Initialize your data structure here.
*/
public MovingAverage(int size) {
deque = new ArrayDeque<>();
this.size = size;
sum = 0.0;
}
public double next(int val) {
if (size == deque.size()) {
deque.add(val);
sum -= deque.pop();
sum += val;
return sum / size;
} else {
deque.add(val);
sum += val;
return sum / deque.size();
}
}
}
/**
* Your MovingAverage object will be instantiated and called as such:
* MovingAverage obj = new MovingAverage(size);
* double param_1 = obj.next(val);
*/