1 public class MovingAverage {
 2     Queue<Integer> q;
 3     double sum = 0;
 4     int size;
 5 
 6     /** Initialize your data structure here. */
 7     public MovingAverage(int s) {
 8         q = new LinkedList();
 9         size = s;
10     }
11 
12     public double next(int val) {
13         if (q.size() == size) {
14             sum = sum - q.poll();
15         }
16         q.offer(val);
17         sum += val;
18         return sum / q.size();
19     }
20 }