数据流中的移动平均值（队列算法demo） --转载

最近刷下力扣，有一题看见了很好的答案，在此记录下：链接如下：https://zhuanlan.zhihu.com/p/345491677

class MovingAverage {
    LinkedList<Integer> queue = new LinkedList<>();
    int size = 0;
    double sum = 0;
    /** Initialize your data structure here. */
    public MovingAverage(int size) {
        this.size = size;
    } 
   public double next(int val) {
        sum+=val;
        if(queue.size()>=size){
            sum-=queue.poll();
        }
        queue.add(val);
        return sum/queue.size();
    }
}

/**
 * Your MovingAverage object will be instantiated and called as such:
 * MovingAverage obj = new MovingAverage(size);
 * double param_1 = obj.next(val);
 */