635 leetcode_[LeetCode] 635. Design Log Storage System

Problem

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

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

Update 2018-10

class LogSystem {

Map logs;

int[] indice;

List gras;

public LogSystem() {

logs = new HashMap<>();

indice = new int[]{4, 7, 10, 13, 16, 19};

gras = Arrays.asList(new String[]{"Year", "Month", "Day", "Hour", "Minute", "Second"});

}

public void put(int id, String timestamp) {

logs.put(timestamp, id);

}

public List retrieve(String s, String e, String gra) {

List res = new LinkedList<>();

int index = indice[gras.indexOf(gra)];

for (String str: logs.keySet()) {

String substr = str.substring(0, index);

if (substr.compareTo(s.substring(0, index)) >= 0 &&

substr.compareTo(e.substring(0, index)) <= 0) res.add(logs.get(str));

}

return res;

}

}

using enum, slightly faster for LC testcases

class LogSystem {

Map log;

public enum Index {

Year(4), Month(7), Day(10), Hour(13), Minute(16), Second(19);

private int index;

Index(int idx) {

this.index = idx;

}

}

public LogSystem() {

log = new HashMap<>();

}

public void put(int id, String timestamp) {

log.put(timestamp, id);

}

public List retrieve(String s, String e, String gra) {

List res = new LinkedList<>();

int index = Index.valueOf(gra).index;

for (String str: log.keySet()) {

String substr = str.substring(0, index);

if (substr.compareTo(s.substring(0, index)) >= 0 &&

substr.compareTo(e.substring(0, index)) <= 0) res.add(log.get(str));

}

return res;

}

}

Using List+Array

class LogSystem {

Map log;

List gras;

int[] indice;

public LogSystem() {

log = new HashMap<>();

gras = Arrays.asList(new String[]{"Year", "Month", "Day", "Hour", "Minute", "Second"});

indice = new int[]{4, 7, 10, 13, 16, 19};

}

public void put(int id, String timestamp) {

log.put(timestamp, id);

}

public List retrieve(String s, String e, String gra) {

List res = new LinkedList<>();

int index = indice[gras.indexOf(gra)];

for (String str: log.keySet()) {

String substr = str.substring(0, index);

if (substr.compareTo(s.substring(0, index)) >= 0 &&

substr.compareTo(e.substring(0, index)) <= 0) res.add(log.get(str));

}

return res;

}

}