LeetCode 359. Logger Rate Limiter(日志漏桶)

本文介绍了一种消息日志系统的实现方案,确保每条消息仅在最近10秒内不重复打印。提供了两种方法:一是利用哈希映射记录各时间点消息并用集合追踪最近10秒内的所有消息;二是优化后的循环数组记录法。
部署运行你感兴趣的模型镜像

原题网址:https://leetcode.com/problems/logger-rate-limiter/

Design a logger system that receive stream of messages along with its timestamps, each message should be printed if and only if it is not printed in the last 10 seconds.

Given a message and a timestamp (in seconds granularity), return true if the message should be printed in the given timestamp, otherwise returns false.

It is possible that several messages arrive roughly at the same time.

Example:

Logger logger = new Logger();

// logging string "foo" at timestamp 1
logger.shouldPrintMessage(1, "foo"); returns true; 

// logging string "bar" at timestamp 2
logger.shouldPrintMessage(2,"bar"); returns true;

// logging string "foo" at timestamp 3
logger.shouldPrintMessage(3,"foo"); returns false;

// logging string "bar" at timestamp 8
logger.shouldPrintMessage(8,"bar"); returns false;

// logging string "foo" at timestamp 10
logger.shouldPrintMessage(10,"foo"); returns false;

// logging string "foo" at timestamp 11
logger.shouldPrintMessage(11,"foo"); returns true;

方法一:使用哈希映射记录各个时间点的消息,使用一个集合记录最近10秒的所有消息。

public class Logger {
    private Map<Integer, List<String>> buf = new HashMap<>();
    private Set<String> set = new HashSet<>();
    private int from = 0;

    /** Initialize your data structure here. */
    public Logger() {
    }
    
    /** Returns true if the message should be printed in the given timestamp, otherwise returns false. The timestamp is in seconds granularity. */
    public boolean shouldPrintMessage(int timestamp, String message) {
        for(int t = from; t <= timestamp - 10; t ++) {
            List<String> b = buf.get(t);
            if (b == null) continue;
            for(String s : b) {
                set.remove(s);
            }
            buf.remove(t);
        }
        if (!set.add(message)) return false;
        List<String> b = buf.get(timestamp);
        if (b == null) {
            b = new ArrayList<>();
            buf.put(timestamp, b);
        }
        b.add(message);
        from = timestamp - 9;
        return true;
    }
}

/**
 * Your Logger object will be instantiated and called as such:
 * Logger obj = new Logger();
 * boolean param_1 = obj.shouldPrintMessage(timestamp,message);
 */

方法二:在方法一基础上优化,使用循环数组来保存最近10秒的消息。

public class Logger {
    private List<String>[] buf = new List[10];
    private Set<String> set = new HashSet<>();
    private int from = 0;

    /** Initialize your data structure here. */
    public Logger() {
        for(int i=0; i<buf.length; i++) buf[i] = new ArrayList<>();
    }
    
    /** Returns true if the message should be printed in the given timestamp, otherwise returns false. The timestamp is in seconds granularity. */
    public boolean shouldPrintMessage(int timestamp, String message) {
        for(int t = from; t <= timestamp - 10; t ++) {
            for(String s : buf[(t+buf.length)%buf.length]) {
                set.remove(s);
            }
            buf[(t+buf.length)%buf.length].clear();
        }
        if (!set.add(message)) return false;
        buf[timestamp%buf.length].add(message);
        from = timestamp - 9;
        return true;
    }
}

/**
 * Your Logger object will be instantiated and called as such:
 * Logger obj = new Logger();
 * boolean param_1 = obj.shouldPrintMessage(timestamp,message);
 */


您可能感兴趣的与本文相关的镜像

Qwen3-8B

Qwen3-8B

文本生成
Qwen3

Qwen3 是 Qwen 系列中的最新一代大型语言模型,提供了一整套密集型和专家混合(MoE)模型。基于广泛的训练,Qwen3 在推理、指令执行、代理能力和多语言支持方面取得了突破性进展

评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值