LeetCode Design Log Storage System

标签：div   complex   from   blog   because   tput   note   range   res   

原题链接在这里：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  */

LeetCode Design Log Storage System

标签：div   complex   from   blog   because   tput   note   range   res   

原文地址：http://www.cnblogs.com/Dylan-Java-NYC/p/7686483.html