number-of-recent-calls

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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

Implement the <code>RecentCounter</code> class:

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

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

&nbsp;
Example 1:

<pre>
Input
[&quot;RecentCounter&quot;, &quot;ping&quot;, &quot;ping&quot;, &quot;ping&quot;, &quot;ping&quot;]
[[], [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
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= t &lt;= 109</code></li>
	<li>Each test case will call <code>ping</code> with strictly increasing values of <code>t</code>.</li>
	<li>At most <code>104</code> calls will be made to <code>ping</code>.</li>
</ul>

Number of Recent Calls

Design

Queue

Data Stream

写一个&nbsp;<code>RecentCounter</code>&nbsp;类来计算特定时间范围内最近的请求。

请你实现 <code>RecentCounter</code> 类：

<ul>
	<li><code>RecentCounter()</code> 初始化计数器，请求数为 0 。</li>
	<li><code>int ping(int t)</code> 在时间 <code>t</code> 添加一个新请求，其中 <code>t</code> 表示以毫秒为单位的某个时间，并返回过去 <code>3000</code> 毫秒内发生的所有请求数（包括新请求）。确切地说，返回在 <code>[t-3000, t]</code> 内发生的请求数。</li>
</ul>

保证 每次对 <code>ping</code> 的调用都使用比之前更大的 <code>t</code> 值。

&nbsp;

示例 1：

<pre>
输入：
["RecentCounter", "ping", "ping", "ping", "ping"]
[[], [1], [100], [3001], [3002]]
输出：
[null, 1, 2, 3, 3]

解释：
RecentCounter recentCounter = new RecentCounter();
recentCounter.ping(1); // requests = [1]，范围是 [-2999,1]，返回 1
recentCounter.ping(100); // requests = [1, 100]，范围是 [-2900,100]，返回 2
recentCounter.ping(3001); // requests = [1, 100, 3001]，范围是 [1,3001]，返回 3
recentCounter.ping(3002); // requests = [1, 100, 3001, 3002]，范围是 [2,3002]，返回 3
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= t &lt;= 109</code></li>
	<li>保证每次对 <code>ping</code> 调用所使用的 <code>t</code> 值都 严格递增</li>
	<li>至多调用 <code>ping</code> 方法 <code>104</code> 次</li>
</ul>