题目:
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.
Example:
HitCounter counter = new HitCounter(); // hit at timestamp 1. counter.hit(1); // hit at timestamp 2. counter.hit(2); // hit at timestamp 3. counter.hit(3); // get hits at timestamp 4, should return 3. counter.getHits(4); // hit at timestamp 300. counter.hit(300); // get hits at timestamp 300, should return 4. counter.getHits(300); // get hits at timestamp 301, should return 3. counter.getHits(301);
Follow up:
What if the number of hits per second could be very large? Does your design scale?
思路:
由于函数调用过程中时间戳永远是单调递增的,所以我们可以简单地用一个队列来实现,队列元素不仅需要记录时间戳,还需要记录在该时间内被击打的次数。为了便于在getHits函数中统计总数,我们还记录截止当前队列中所有时间内的击打次数总和。每次击打的时候,就更新队列数据及击打总次数;每次获取5分钟内的击打次数的时候,就需要删除队列中5分钟之外的元素,并且更新击打次数总和的值。
代码:
class HitCounter {
public:
/** Initialize your data structure here. */
HitCounter() {
sum = 0;
}
/** Record a hit.
@param timestamp - The current timestamp (in seconds granularity). */
void hit(int timestamp) {
if(!q.empty() && q.back().first == timestamp) {
++q.back().second;
++sum;
}
else {
q.push(make_pair(timestamp, 1));
++sum;
}
}
/** Return the number of hits in the past 5 minutes.
@param timestamp - The current timestamp (in seconds granularity). */
int getHits(int timestamp) {
while(!q.empty() && (timestamp - q.front().first >= 300)) {
sum -= q.front().second;
q.pop();
}
return sum;
}
private:
queue<pair<int, int>> q;
int sum;
};
/**
* Your HitCounter object will be instantiated and called as such:
* HitCounter obj = new HitCounter();
* obj.hit(timestamp);
* int param_2 = obj.getHits(timestamp);
*/