933. Number of Recent Calls（python+cpp）

最新推荐文章于 2021-04-19 18:43:35 发布

小湉湉

最新推荐文章于 2021-04-19 18:43:35 发布

阅读量552

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/qq_21275321/article/details/83743933

LeetCode 专栏收录该内容

327 篇文章

订阅专栏

本文介绍了一种使用滑动窗口技术实现的计数器设计，能够高效地统计最近3000毫秒内的请求次数。通过队列数据结构，确保了每次ping操作都能快速更新并返回有效期内的请求数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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 pings 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 to ping.
Each test case will call ping with strictly increasing values of t.
Each call to ping will have 1 <= t <= 10^9.
解释：
注意 ping 是严格按照时间增长的顺序进行的，也就是说，数组一定是递增的。
用队列做。
python代码：

class RecentCounter:

    def __init__(self):
        self.data=[];

    def ping(self, t):
        """
        :type t: int
        :rtype: int
        """
        while self.data and t-self.data[0]>3000:
            self.data.pop(0)
        self.data.append(t)
        return len(self.data)
        
# Your RecentCounter object will be instantiated and called as such:
# obj = RecentCounter()
# param_1 = obj.ping(t)

c++代码：

#include<queue>
using namespace std;
class RecentCounter {
public:
    queue<int>_queue;
    RecentCounter() {
        
    }
    
    int ping(int t) {
        while (!_queue.empty() && t-_queue.front()>3000)
            _queue.pop();
        _queue.push(t);
        return _queue.size();
    }
};

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

总结：