LeetCode Design Log Storage System

本文介绍了一种实现LeetCode上设计日志存储系统的题目解决方案。通过使用列表存储日志,并根据granularity参数确定的时间粒度来检索指定时间段内的日志ID。此方法简单高效,适用于不超过300条日志的场景。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

原题链接在这里:https://leetcode.com/problems/design-log-storage-system/description/

题目:

You are given several logs that each log contains a unique id and timestamp. Timestamp is a string that has the following format: Year:Month:Day:Hour:Minute:Second, for example, 2017:01:01:23:59:59. All domains are zero-padded decimal numbers.

Design a log storage system to implement the following functions:

void Put(int id, string timestamp): Given a log's unique id and timestamp, store the log in your storage system.

int[] Retrieve(String start, String end, String granularity): Return the id of logs whose timestamps are within the range from start to end. Start and end all have the same format as timestamp. However, granularity means the time level for consideration. For example, start = "2017:01:01:23:59:59", end = "2017:01:02:23:59:59", granularity = "Day", it means that we need to find the logs within the range from Jan. 1st 2017 to Jan. 2nd 2017.

Example 1:

put(1, "2017:01:01:23:59:59");
put(2, "2017:01:01:22:59:59");
put(3, "2016:01:01:00:00:00");
retrieve("2016:01:01:01:01:01","2017:01:01:23:00:00","Year"); // return [1,2,3], because you need to return all logs within 2016 and 2017.
retrieve("2016:01:01:01:01:01","2017:01:01:23:00:00","Hour"); // return [1,2], because you need to return all logs start from 2016:01:01:01 to 2017:01:01:23, where log 3 is left outside the range.

Note:

  1. There will be at most 300 operations of Put or Retrieve.
  2. Year ranges from [2000,2017]. Hour ranges from [00,23].
  3. Output for Retrieve has no order required.

题解:

用list直接存log. 根据granularity取出timestamp的substring直接比较.

Time Complexity: put, O(1). retrieve, O(logs.size()).

Space: O(logs.size()).

AC Java:

 1 class LogSystem {
 2     List<String []> logs;
 3     List<String> units = Arrays.asList("Year", "Month", "Day", "Hour", "Minute", "Second");
 4     int [] indices = new int[]{4,7,10,13,16,19};
 5     
 6     public LogSystem() {
 7         logs = new LinkedList<String []>();
 8     }
 9     
10     public void put(int id, String timestamp) {
11         logs.add(new String[]{Integer.toString(id), timestamp});
12     }
13     
14     public List<Integer> retrieve(String s, String e, String gra) {
15         List<Integer> res = new ArrayList<Integer>();
16         int ind = indices[units.indexOf(gra)];
17         
18         String sSub = s.substring(0, ind);
19         String eSub = e.substring(0, ind);
20         
21         for(String [] log : logs){
22             String sub = log[1].substring(0, ind);
23             if(sub.compareTo(sSub)>=0 && sub.compareTo(eSub)<=0){
24                 res.add(Integer.valueOf(log[0]));
25             }
26         }
27         return res;
28     }
29 }
30 
31 /**
32  * Your LogSystem object will be instantiated and called as such:
33  * LogSystem obj = new LogSystem();
34  * obj.put(id,timestamp);
35  * List<Integer> param_2 = obj.retrieve(s,e,gra);
36  */

 

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/7686483.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值