题目:
示例:
解释:
提示:
代码:队列
package jianzhi;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
public class offer_42 {
class RecentCounter {
Queue<Integer> queue;
// 初始化队列
public RecentCounter() {
queue = new LinkedList<>();
}
public int ping(int t) {
queue.offer(t);
// 不在范围内则出队
while (queue.peek() < t - 3000)
queue.poll();
return queue.size();
}
}
/**
* Your RecentCounter object will be instantiated and called as such:
* RecentCounter obj = new RecentCounter();
* int param_1 = obj.ping(t);
*/
}
参考链接:
力扣