Leetcode学习笔记：#933. Number of Recent Calls

原创于 2019-05-13 18:36:07 发布 · 164 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

110 篇文章

订阅专栏

本文介绍了解决LeetCode上编号为933的问题Number of Recent Calls的方法。该问题要求设计一个名为RecentCounter的类来计算最近3000毫秒内的调用次数。通过使用队列数据结构，每次调用ping方法时，都会将当前时间加入队列，并移除所有超过3000毫秒前的时间记录，最后返回队列的大小即为近期调用次数。

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

Leetcode学习笔记：933. Number of Recent Calls

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.

实现：

    Queue<Integer> q;

    public RecentCounter() {
        q = new LinkedList<>();
    }
    
    public int ping(int t) {
        q.offer(t);
        while (q.peek() < t - 3000) { q.poll(); }
        return q.size();
    }