Leetcode - 359 log rate limiter (Design)

Hashtable

class Logger {
    
    //printMap It records the time when the string was last printed 
    private Map<String,Integer> printMap;
    public Logger() {
    
        printMap = new HashMap<>();
    }
    
    public boolean shouldPrintMessage(int timestamp, String message) {
    
        if(printMap.get(message) == null)// character string  message It hasn't been printed yet 
        {
    
            // You can print 
            printMap.put(message,timestamp);
            return true;
        }
        else{
    
            // Last printed time 
            int last = printMap.get(message);
            // You can print 
            if(last+10 <= timestamp){
    
                printMap.put(message,timestamp);
                return true;
            }
            else
               return false;
        }
    }
}

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

queue + Hash set

class Logger {
    
    class Node{
    
        int timestamp;
        String message;
        public Node(int timestamp,String message){
    
            this.message = message;
            this.timestamp = timestamp;
        }
    }
    Deque<Node> deque;
    Set<String> set ;
    public Logger() {
    
         deque = new LinkedList<>();
         set = new HashSet<>();
    }
    
    public boolean shouldPrintMessage(int timestamp, String message) {
    
        while(deque.size()!=0 && deque.peekFirst().timestamp + 10 <= timestamp)
            set.remove(deque.pollFirst().message);
        if(set.contains(message))
           return false;
        else{
    
            deque.offerLast(new Node(timestamp,message));
            set.add(message);
            return true;
        }
    }
}