剑指 Offer II 041. 滑动窗口的平均值

题目链接：

 

力扣https://leetcode-cn.com/problems/qIsx9U/

【分析】用队列，根据先进先出的思想，维护一个size大小的队列，当队列满时就让头出队，尾加入新元素即可。

class MovingAverage {

    public Deque<Integer> deque = new ArrayDeque<>();
    public int size;

    /** Initialize your data structure here. */
    public MovingAverage(int size) {
        this.size = size;
    }

    public double next(int val) {
        double sum = 0;
        if(deque.size() < size){
            deque.offerLast(val);
        }else{
            deque.pollFirst();
            deque.offerLast(val);
        }
        for(Integer it: deque){
            sum += it;
        }
        return sum / deque.size();
    }
}

【方法二 数组】用一个长数组记录前面点的信息，同时记录一下当前整个窗口的总和，然后每次来的时候向前查找size个单位的数，总和的基础上减去这个数，并加上新来的数。

class MovingAverage {

    double sum = 0;
    int[] arrs = new int[10004];
    int k = 0;
    int size;

    /** Initialize your data structure here. */
    public MovingAverage(int size) {
        this.size = size;
    }

    public double next(int val) {
        arrs[k++] = val;
        if(k <= size){
            sum += val;
            return sum / k;
        }
        sum -= arrs[k - size - 1];
        sum += val;
        return sum / size;
    }
}