leetcode 933 Number of Recent Calls

Write a class RecentCounter to count recent requests.

It has only one method: ping(int t), where t represents some time in milliseconds.

Return the number of pings that have been made from 3000 milliseconds ago until now.

Any ping with time in [t - 3000, t] will count, including the current ping.

It is guaranteed that every call to ping uses a strictly larger value of t than before.

Example 1:

Input: inputs = [“RecentCounter”,“ping”,“ping”,“ping”,“ping”], inputs = [[],[1],[100],[3001],[3002]]
Output: [null,1,2,3,3]

记录在3000-t 到现在的t为止有多少个“ping”

思路：
用一个队列，每出现一个ping，在队列中add时间t，最后队列的size就是ping出现的次数
然后是移出3000-t范围以外的时间，因为题目中说t是按时间顺序的，也就是升序，所以只需要逐个看队列里的时间，小于3000-t的全部移掉就行了

代码：

class RecentCounter {

    LinkedList<Integer> queue;
    int small = 0;
    
    public RecentCounter() {
        queue = new LinkedList<Integer>();
    }
    
    public int ping(int t) {
        queue.add(t);
        small = t - 3000;
        while (queue.size() > 0 && queue.peek() < small) {
            queue.poll();
        }
        return queue.size();
    }
}