2022.07.19(LC_剑指 Offer II 041. 滑动窗口的平均值)

 方法一：队列

       由于数字进入滑动窗口和移出滑动窗口的规则符合先进先出，因此可以使用队列存储滑动窗口中的数字，同时维护滑动窗口的大小以及滑动窗口的数字之和。

class MovingAverage {
    Queue<Integer> queue;
    int size;
    double sum;

    public MovingAverage(int size) {
        queue = new ArrayDeque<>();
        this.size = size;
        sum = 0;
    }

    public double next(int val) {
        if (queue.size() == size) {
            sum -= queue.poll();
        }
        queue.offer(val);
        sum += val;
        return sum / queue.size();
    }
}

class MovingAverage {
    Queue<Integer> queue;
    int size;
    /** Initialize your data structure here. */
    public MovingAverage(int size) {
        queue = new LinkedList<>();
        this.size = size;
    }
    
    public double next(int val) {
        queue.offer(val);
        double sum = 0;
        if (queue.size() <= size) {
            for (int i = 1; i <= queue.size(); i++) {
                int v = queue.poll();
                sum += v;
                queue.offer(v);
            }
        } else {
            for (int i = 1; i <= queue.size() - size; i++) {
                queue.poll();
            }
            for (int i = 1; i <= queue.size(); i++) {
                int v = queue.poll();
                sum += v;
                queue.offer(v);
            }
        }
        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);
 */

 方法二：滚动数组

class MovingAverage {
    int[] vals;
    int n;
    int elementSize;
    double sum;

    public MovingAverage(int size) {
        vals = new int[size];
        n = size;
    }

    public double next(int val) {
        elementSize++;
        int pos = (elementSize - 1) % n;//找到整数存放的位置
        //如果数组已满，需要移除窗口中对应的数
        if (elementSize > n) {
            sum -= vals[pos];
        }
        sum += val;
        vals[pos] = val;//相当于每次按数组下标0，……，n - 1进行添加
        if (elementSize > n) {
            return sum / n;
        } else {
            return sum / elementSize;
        }
    }
}