Leetcode 933.最近的请求次数

原题链接 Leetcode 933. Number of Recent Calls

You have a RecentCounter class which counts the number of recent requests within a certain time frame.

Implement the RecentCounter class:

• RecentCounter() Initializes the counter with zero recent requests.
• int ping(int t) Adds a new request at time t, where t represents some time in milliseconds, and returns the number of requests that has happened in the past 3000 milliseconds (including the new request). Specifically, return the number of requests that have happened in the inclusive range [t - 3000, t].

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

Example 1:

Input
["RecentCounter", "ping", "ping", "ping", "ping"]
[[], [1], [100], [3001], [3002]]
Output
[null, 1, 2, 3, 3]

Explanation
RecentCounter recentCounter = new RecentCounter();
recentCounter.ping(1);     // requests = [1], range is [-2999,1], return 1
recentCounter.ping(100);   // requests = [1, 100], range is [-2900,100], return 2
recentCounter.ping(3001);  // requests = [1, 100, 3001], range is [1,3001], return 3
recentCounter.ping(3002);  // requests = [1, 100, 3001, 3002], range is [2,3002], return 3

Constraints:

• 1 <= t <= 10⁹
• Each test case will call ping with strictly increasing values of t.
• At most 10⁴ calls will be made to ping.

---

方法一：队列

思路：

用一个队列维护发生请求的时间，当在时间 t 收到请求时，将时间 t 入队。

队首到队尾的时间值是单调递增的。当在时间 tt 收到请求时，不断从队首弹出 < t−3000 的时间。最后输出队列的长度即可。

c++代码：

class RecentCounter {
    queue<int> q;
public:
    RecentCounter() {

    }
    
    int ping(int t) {
        q.push(t);
        while(q.front() < t - 3000){
            q.pop();
        }
        return q.size();
    }
};

/**
 * Your RecentCounter object will be instantiated and called as such:
 * RecentCounter* obj = new RecentCounter();
 * int param_1 = obj->ping(t);
 */

复杂度分析：

• 时间复杂度：均摊 O(1)，每个元素至多入队出队各一次。
• 空间复杂度：O(L) L为队列最大元素个数