标签：return and hat current pre logic receive list which
Design a hit counter which counts the number of hits received in the past 5 minutes.
Each function accepts a timestamp parameter (in seconds granularity) and you may assume that calls are being made to the system in chronological order (ie, the timestamp is monotonically increasing). You may assume that the earliest timestamp starts at 1.
It is possible that several hits arrive roughly at the same time.
class HitCounter { Queue<Integer> queue; /** Initialize your data structure here. */ public HitCounter() { queue = new LinkedList<>(); } /** Record a hit. @param timestamp - The current timestamp (in seconds granularity). */ public void hit(int timestamp) { queue.offer(timestamp); } /** Return the number of hits in the past 5 minutes. @param timestamp - The current timestamp (in seconds granularity). */ public int getHits(int timestamp) { while(!queue.isEmpty() && timestamp - queue.peek() >= 300) { queue.poll(); } return queue.size(); } } /** * Your HitCounter object will be instantiated and called as such: * HitCounter obj = new HitCounter(); * obj.hit(timestamp); * int param_2 = obj.getHits(timestamp); */
标签：return and hat current pre logic receive list which
原文地址：https://www.cnblogs.com/xuanlu/p/12010180.html
