LeetCode Design 362. Hit Counter

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?

思路：
1. 题目的限制，5分钟或300秒，即：有点击，就放入queue，每次计算总共有效的点击时，就看queue顶端的时间，看是否在300秒内：超时则pop()，直到在queue内的都是在300秒窗口内的点击。
2. 是不是每次都需要去从0统计在queue内点击次数呢？这里有一个trick，push的时候总的点击数就加，pop的时候总点击数就减，这样可以得到实时的点击数值。即：用一个变量去记录历史情况！
3. 需要提取利用的信息：用变量实时记录点击总次数！

class HitCounter {
public:
    /** Initialize your data structure here. */
    HitCounter() {
    totalCount=0;
    }

    void hit(int timestamp) {
        totalCount++;
        if(!qq.empty()&&qq.back().first==timestamp)
            qq.back().second++;
        else
            qq.push({timestamp,1});
    }

    int getHits(int timestamp) {
        while(timestamp-300>=qq.front().first){
            totalCount-=qq.front().second;
            qq.pop();
        }
        return totalCount;
    }
private:
    queue<pair<int,int>> qq;
    int totalCount;
};