当前位置：网站首页>2022.7.16-----leetcode.剑指offer.041

2022.7.16-----leetcode.剑指offer.041

2022-07-17 10:23:00 【路Lu727】

  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;
        }
    }

原网站

版权声明
本文为[路Lu727]所创，转载请带上原文链接，感谢
https://blog.csdn.net/weixin_60466670/article/details/125824311