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 timet
, wheret
represents some time in milliseconds, and returns the number of requests that has happened in the past3000
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 <= 109
- Each test case will call
ping
with strictly increasing values oft
. - At most
104
calls will be made toping
.
SOLUTION:
import bisect
class RecentCounter:
def __init__(self):
self.times = []
def ping(self, t: int) -> int:
bisect.insort(self.times, t)
n = len(self.times)
return n - bisect.bisect_left(self.times, t - 3000)
# Your RecentCounter object will be instantiated and called as such:
# obj = RecentCounter()
# param_1 = obj.ping(t)
Top comments (0)