zoukankan      html  css  js  c++  java
  • [LeetCode] 359. 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;

    Credits:
    Special thanks to @memoryless for adding this problem and creating all test cases.

    这道题让我们设计一个记录系统每次接受信息并保存时间戳,然后让我们打印出该消息,前提是最近10秒内没有打印出这个消息。这不是一道难题,我们可以用哈希表来做,建立消息和时间戳之间的映射,如果某个消息不再哈希表表,我们建立其和时间戳的映射,并返回true。如果应经在哈希表里了,我们看当前时间戳是否比哈希表中保存的时间戳大10,如果是,更新哈希表,并返回true,反之返回false,参见代码如下:

    解法一:

    class Logger {
    public:
        Logger() {}
        
        bool shouldPrintMessage(int timestamp, string message) {
            if (!m.count(message)) {
                m[message] = timestamp;
                return true;
            } 
            if (timestamp - m[message] >= 10) {
                m[message] = timestamp;
                return true;
            }
            return false;
        }
    
    private:
        unordered_map<string, int> m;
    };


    我们还可以写的更精简一些,如下所示:

    解法二:

    class Logger {
    public:
        Logger() {}
        
        bool shouldPrintMessage(int timestamp, string message) {
            if (timestamp < m[message]) return false;
            m[message] = timestamp + 10;
            return true;
        }
    
    private:
        unordered_map<string, int> m;
    };

    参考资料:

    https://leetcode.com/discuss/108703/short-c-java-python-bit-different

    LeetCode All in One 题目讲解汇总(持续更新中...)

  • 相关阅读:
    MySQL数据库的完全备份与恢复
    MySQL数据库之索引、事务、存储引擎详细讲解
    LNMP架构介绍与部署
    Haproxy搭建Web集群
    LAMP环境之MySQL服务安装详细过程
    MySQL主从复制详解
    LAMP环境之编译安装httpd服务
    搭建yum软件仓库,让你维护轻松自如
    Shell脚本一键安装Samba服务
    Shell脚本之冒泡排序
  • 原文地址:https://www.cnblogs.com/grandyang/p/5592635.html
Copyright © 2011-2022 走看看