Leetcode 933. Number of Recent Calls

小白菜又菜

于 2024-09-01 11:35:35 发布

阅读量133

点赞数 1

分类专栏： Leetcode 入门题文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/mobius_strip/article/details/141782029

版权

入门题同时被 2 个专栏收录

291 篇文章 2 订阅

订阅专栏

Leetcode

146 篇文章 0 订阅

订阅专栏

Problem

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 time t, where t represents some time in milliseconds, and returns the number of requests that has happened in the past 3000 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.

Algorithm

Use a list to save the distance no more than 3000 and count the size.

Code

class RecentCounter:

    def __init__(self):
        self.pings = deque()

    def ping(self, t: int) -> int:
        self.pings.append(t)
        while self.pings[0] < t - 3000:
            self.pings.popleft()
        return len(self.pings)

# Your RecentCounter object will be instantiated and called as such:
# obj = RecentCounter()
# param_1 = obj.ping(t)