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:
There will be at most 300 operations of Put or Retrieve.
Year ranges from [2000,2017]. Hour ranges from [00,23].
Output for Retrieve has no order required.
Solution
设计一个储存id + timestamp的数据结构。可以实现存储和取回指定时间段的timestamp的id,指定的时间段可以指定到年或精确到秒
Using a list which stores a string[] of id and timestamp. A list of granularity to find the index of right index to substring timestamp for comparation. For put, just put a new String[] into timestamps. Then for retrive, find the right index, iterate the whole list and find timestamps in this range and return their id.
Code
class LogSystem {
List<String[]> timeStamps;
List<String> granularity;
int[] indexs;
public LogSystem() {
timeStamps = new ArrayList<>();
granularity = Arrays.asList("Year", "Month", "Day", "Hour", "Minute", "Second");
indexs = new int[]{4, 7, 10, 13, 16, 19};
}
public void put(int id, String timestamp) {
timeStamps.add(new String[]{Integer.toString(id), timestamp});
}
public List<Integer> retrieve(String s, String e, String gra) {
List<Integer> res = new ArrayList<>();
int index = indexs[granularity.indexOf(gra)];
for (String[] ts : timeStamps){
if (ts[1].substring(0, index).compareTo(s.substring(0, index)) >= 0
&& ts[1].substring(0, index).compareTo(e.substring(0, index)) <= 0){
res.add(Integer.parseInt(ts[0]));
}
}
return res;
}
}
/**
* Your LogSystem object will be instantiated and called as such:
* LogSystem obj = new LogSystem();
* obj.put(id,timestamp);
* List<Integer> param_2 = obj.retrieve(s,e,gra);
*/
Time Complexity: O(n)
Space Complexity: O(n)
Review
Using a hashmap may help simplify find index for gra.
class LogSystem {
List<String[]> timeStamps;
Map<String, Integer> indexs;
public LogSystem() {
timeStamps = new ArrayList<>();
indexs = new HashMap<>();
indexs.put("Year", 4);
indexs.put("Month", 7);
indexs.put("Day", 10);
indexs.put("Hour", 13);
indexs.put("Minute", 16);
indexs.put("Second", 19);
}
public void put(int id, String timestamp) {
timeStamps.add(new String[]{Integer.toString(id), timestamp});
}
public List<Integer> retrieve(String s, String e, String gra) {
List<Integer> res = new ArrayList<>();
int index = indexs.get(gra);
for (String[] ts : timeStamps){
if (ts[1].substring(0, index).compareTo(s.substring(0, index)) >= 0
&& ts[1].substring(0, index).compareTo(e.substring(0, index)) <= 0){
res.add(Integer.parseInt(ts[0]));
}
}
return res;
}
}
/**
* Your LogSystem object will be instantiated and called as such:
* LogSystem obj = new LogSystem();
* obj.put(id,timestamp);
* List<Integer> param_2 = obj.retrieve(s,e,gra);
*/