zoukankan      html  css  js  c++  java
  • leetcode359

    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.

    Map。
    存:时间点
    查:看时间点过期没来决定布尔值。

    细节:

    不应该加的时候不要更新map。

    实现:

    class Logger {
    
        private Map<String, Integer> map;
        /** Initialize your data structure here. */
        public Logger() {
            this.map = new HashMap<>();
        }
        
        /** 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) {
            boolean ans = false;
            if (!map.containsKey(message) || map.get(message) + 10 <= timestamp) {
                ans = true;
                map.put(message, timestamp);
            }
            return ans;
        }
    }
    
    /**
     * Your Logger object will be instantiated and called as such:
     * Logger obj = new Logger();
     * boolean param_1 = obj.shouldPrintMessage(timestamp,message);
     */
  • 相关阅读:
    有向强连通分支Tarjan算法
    让理科生沉默,让文科生落泪的题
    迷宫求解(数据结构栈应用)
    编程中无穷大常量的设定技巧
    poj 3159 差分约束+spfa
    codevs 1690 线段树
    uvalive 2756 环形排列颠倒的次数
    poj 2182 树状数组
    uva 10943 数学
    uva 10780 分解质因数
  • 原文地址:https://www.cnblogs.com/jasminemzy/p/9668049.html
Copyright © 2011-2022 走看看