int n;
int sum;
Deque<Integer> q;
/** Initialize your data structure here. */
public MovingAverage(int size) {
n=size;
sum=0;
q=new ArrayDeque<>();
}
public double next(int val) {
if(q.size()<n){
q.add(val);
sum+=val;
return (double)sum/q.size();
}else{
sum-=q.poll();
q.add(val);
sum+=val;
return (double) sum/n;
}
}
2022.7.16-----leetcode.剑指offer.041
最新推荐文章于 2024-07-27 17:56:15 发布