Write a class RecentCounter
to count recent requests.
It has only one method: ping(int t)
, where t represents some time in milliseconds.
Return the number of ping
s that have been made from 3000 milliseconds ago until now.
Any ping with time in [t - 3000, t]
will count, including the current ping.
It is guaranteed that every call to ping
uses a strictly larger value of t
than before.
Example 1:
Input: inputs = ["RecentCounter","ping","ping","ping","ping"], inputs = [[],[1],[100],[3001],[3002]] Output: [null,1,2,3,3]
Note:
- Each test case will have at most
10000
calls toping
. - Each test case will call
ping
with strictly increasing values oft
. - Each call to ping will have
1 <= t <= 10^9
.
// OJ: https://leetcode.com/problems/number-of-recent-calls/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(N)
class RecentCounter {
private:
queue<int> times;
public:
RecentCounter() {}
int ping(int t) {
times.push(t);
t -= 3000;
while (times.front() < t) times.pop();
return times.size();
}
};