데이터 흐름 슬라이딩 창 평균(LintCode 제목)

배경.

자체 코드: 총 3686ms 소요

public class MovingAverage {
    private int size;
    private Queue<Integer> queue;
    /*
    * @param size: An integer
    */public MovingAverage(int size) {
        // do intialization if necessary
        this.size=size;
        queue=new ArrayDeque(size);
    }

    /*
     * @param val: An integer
     * @return:  
     */
    public double next(int val) {
        // write your code here
        int length;
        double result=0.00000;
        if((length=queue.size())==size){//        
            queue.poll();
            queue.add(val);
            Iterator iterator=queue.iterator();
            while(iterator.hasNext()){
                result+=(Integer)iterator.next();
                }
            return result/length;
        }else{
            queue.add(val);
            length=queue.size();
            Iterator iterator=queue.iterator();
            while(iterator.hasNext()){
                result+=(Integer)iterator.next();
            }
           return result/length;
        }
    }
   
}

다른 사람의 코드: 총 1732ms 소모

public class MovingAverage {
    private final int maxSize;
    private final Queue<Integer> window;
    private long sum = 0;
    
    public MovingAverage(int maxSize) {
        this.maxSize = maxSize;
        this.window = new ArrayDeque<>(maxSize + 1);
    }

    public double next(int val) {
        window.add(val);
        sum += val;
        if (window.size() > maxSize) {
            sum -= window.poll();
        }
        return (double) sum / window.size();
    }
}

깨닫다