1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
|
public class { private int size; private Queue<Integer> queue; private double sum;
public (int size) { this.queue = new LinkedList<Integer>(); this.size = size; this.sum = 0; }
public double next(int val) { sum += val; queue.offer(val); if (queue.size() > size) { sum = sum - queue.poll();
} return sum / queue.size();
} }
|
近期评论