剑指offer 专项突破版 41、滑动窗口的平均值

题目链接

思路

随着后续数字的加入，会挤掉最开始出现的数字，符合先进先出的特点，所以需要用队列来实现。注意计算平均值我们是保存了滑动窗口数字的和，最后在返回的时候再除以队列的长度。(需要把分母转变为double或者float，否则结果会被取整)

import java.util.LinkedList;
import java.util.Queue;

public class MovingAverage {

    Queue<Integer> nums;
    int size,sum;

    /** Initialize your data structure here. */
    public MovingAverage(int size) {
        nums = new LinkedList<>();
        this.size = size;
    }

    public double next(int val) {
        sum += val;

        if(nums.size() == size){
            sum -= nums.remove();
        }
        nums.add(val);
        return (double)sum/nums.size();
    }
}

Go代码

type MovingAverage struct {
	size, sum int
	q         []int
}

/** Initialize your data structure here. */
func Constructor(size int) MovingAverage {
	return MovingAverage{
		size: size,
		q:    []int{},
	}
}

func (this *MovingAverage) Next(val int) float64 {
	if len(this.q) >= this.size {
		this.sum -= this.q[0]
		this.q = this.q[1:len(this.q)]
	}
	this.sum += val
	this.q = append(this.q, val)

	return float64(this.sum) / float64(len(this.q))
}