Leetcode 359: Logger Rate Limiter

问题描述：
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.
解释： 每一条信息对应一个发布时间，要求同样的信息在10秒内不可重复发布。判断给定的一串信息哪些可以发布，那些不要发布

思路：
思路很简单，就是通过哈希表来实现查找上一次出现信息的时间。然后如果其时间差小于十，选择不发布，否则记录新信息然后发布。

代码如下：

class Logger {
    private Map<String, Integer> map;
    /** Initialize your data structure here. */
    public Logger() {
        map=new HashMap<String, Integer>();
    }
    
    /** 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. */
    public boolean shouldPrintMessage(int timestamp, String message) {
        if (!map.containsKey(message)){
            map.put(message, timestamp);
            return true;
        }
        else{
            if(map.get(message)+10<=timestamp){
                map.put(message, timestamp);
                return true;
            }
            else{
                return false;
            }
        }
    }
}

时间复杂度: O(n)