算法练习笔记（十八）—— 自设一个存储时间系统

地址：https://leetcode.com/problems/design-log-storage-system/#/description

题目：Design Log Storage System

描述：

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.

简而言之就是要编译一个系统在存储几个时间点之后，给出所需两个时间点间的时间的id

解析：

class LogSystem {public:    unordered_map<string, int> mp;    unordered_map<string, int> mapping;    LogSystem() {        mapping["Year"] = 0;        mapping["Month"] = 1;        mapping["Day"] = 2;        mapping["Hour"] = 3;        mapping["Minute"] = 4;        mapping["Second"] = 5;    }        void put(int id, string timestamp) {        mp[timestamp] = id;       }        vector<int> retrieve(string s, string e, string gra) {        vector<int> result;        for (auto p : mp) {            string tp = p.first;            if (bigger(tp, s, gra) && smaller(tp, e, gra)) result.push_back(p.second);        }        return result;    }    bool smaller(string t1, string t2, string grad) {        auto w1 = split(t1);        auto w2 = split(t2);        for (int i = 0; i <= mapping[grad]; i++) {            if (w1[i] > w2[i]) return false;            else if (w1[i] < w2[i]) return true;        }        return true;    }        bool bigger(string t1, string t2, string grad) {        auto w1 = split(t1);        auto w2 = split(t2);        for (int i = 0; i <= mapping[grad]; i++) {            if (w1[i] < w2[i]) return false;            else if (w1[i] > w2[i]) return true;        }        return true;    }        vector<int> split(string t) {        vector<int> words;        istringstream iss(t);        string s;        while (getline(iss, s, ':')) {            words.push_back(stoi(s));        }        return words;    }};/** * Your LogSystem object will be instantiated and called as such: * LogSystem obj = new LogSystem(); * obj.put(id,timestamp); * vector<int> param_2 = obj.retrieve(s,e,gra); */