359.Logger Rate Limiter
Problem description:
Design a logger system that receives a stream of messages along with their timestamps. Each unique message should only be printed at most every 10 seconds (i.e. a message printed at timestamp t
will prevent other identical messages from being printed until timestamp t + 10
).
All messages will come in chronological order. Several messages may arrive at the same timestamp.
Implement the Logger
class:
Logger()
Initializes thelogger
object.bool shouldPrintMessage(int timestamp, string message)
Returnstrue
if themessage
should be printed in the giventimestamp
, otherwise returnsfalse
.
Example 1:
1 | Input |
Constraints:
0 <= timestamp <= 109
- Every
timestamp
will be passed in non-decreasing order (chronological order). 1 <= message.length <= 30
- At most
104
calls will be made toshouldPrintMessage
.
Solution:
1 | class Logger: |
Circular buffer
1 | class Logger: |
time complexity: $O()$
space complexity: $O()$
reference:
related problem: