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;

题目链接：

---

思路分析

限定每一条消息的发送频率不能低于10秒。

建立一个message到time到hash 映射。然后判断timestamp是否可以发送，可以的话就更新映射值。

代码

class Logger {
public:
    /** Initialize your data structure here. */
    map<string, int> ok;

    Logger() {

    }

    /** Returns true if the message should be printed in the given timestamp, otherwise returns false.
        If this method returns false, the message will not be printed.
        The timestamp is in seconds granularity. */
    bool shouldPrintMessage(int timestamp, string message) {
        if(timestamp < ok[message])
            return false;
        ok[message] = timestamp + 10;
        return true;

    }
};

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

时间复杂度：$O(1)$
空间复杂度：$O(n)$

---

反思

hash map是真心的好用啊。