[leetcode-635-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.

思路：

用map去存储时间戳和id之间的映射，

将字符串形式的时间戳处理成整数形式的数组，便于比较。

还有就是将起始置为0，结束置为最大99，这样就能保证比较容易找到在这区间内的了。

map<string, vector<int>>mp;
     map<string, int>idmap;
     map<string, int>mapping;
     Solution()
     {
         mapping["Year"] = ;
         mapping["Month"] = ;
         mapping["Day"] = ;
         mapping["Hour"] = ;
         mapping["Minute"] = ;
         mapping["Second"] = ;
     }
     vector<int> convert(string s)
     {
         for (int i = ; i < s.size();i++)if (s[i] == ':')s[i] = ' ';
         stringstream ss(s);
         int x;
         vector<int>a;
         while (ss >> x)a.push_back(x);
         return a;
     }

     void put(int id, string timestamp)
     {
         idmap[timestamp] = id;
         mp[timestamp] = convert(timestamp);
     }
     vector<int> retrieve(string s, string e, string gra)
     {
         vector<int>result;
         vector<int>from = convert(s), to = convert(e);
         for (int i = mapping[gra] + ; i < ;i++)
         {
             from[i] = ;
             to[i] = ;
         }
         for (auto &it : mp)
         {
             if (it.second >= from && it.second <= to)
             {
                 result.push_back(idmap[it.first]);
             }
         }
         return result;
     }