Leetcode: Logger Rate Limiter
LeetCode Logger rate
2023-09-11 14:14:07 时间
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;
HashMap
1 public class Logger { 2 HashMap<String, Integer> map; 3 4 /** Initialize your data structure here. */ 5 public Logger() { 6 map = new HashMap<String, Integer>(); 7 } 8 9 /** Returns true if the message should be printed in the given timestamp, otherwise returns false. 10 If this method returns false, the message will not be printed. 11 The timestamp is in seconds granularity. */ 12 public boolean shouldPrintMessage(int timestamp, String message) { 13 if (!map.containsKey(message) || timestamp >= map.get(message)) { 14 map.put(message, timestamp+10); 15 return true; 16 } 17 return false; 18 } 19 } 20 21 /** 22 * Your Logger object will be instantiated and called as such: 23 * Logger obj = new Logger(); 24 * boolean param_1 = obj.shouldPrintMessage(timestamp,message); 25 */
相关文章
- leetcode 之Search in Rotated Sorted Array(三)
- Java实现 LeetCode 821 字符的最短距离(暴力)
- Java实现 LeetCode 1111 有效括号的嵌套深度(阅读理解题,位运算)
- Java实现 LeetCode 563 二叉树的坡度(又是一个遍历树)
- Java实现 LeetCode 546 移除盒子(递归,vivo秋招)
- Java实现 LeetCode 451 根据字符出现频率排序
- Java实现 LeetCode 397 整数替换
- Java实现 LeetCode 140 单词拆分 II(二)
- Java实现 LeetCode 2 两数相加
- LeetCode-2363. 合并相似的物品【哈希表,排序】
- [LeetCode] 628. 三个数的最大乘积 ☆
- 【Mac系统】Vscode使用LeetCode插件报错‘leetcode.toggleLeetCodeCn‘ not found
- 【Leetcode刷题Python】 LeetCode 2038. 如果相邻两个颜色均相同则删除当前颜色