Design a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain timestamp.
Implement the TimeMap class:
TimeMap() Initializes the object of the data structure.
void set(String key, String value, int timestamp) Stores the key key with the value value at the given time timestamp.
String get(String key, int timestamp) Returns a value such that set was called previously, with timestamp_prev <= timestamp. If there are multiple such values, it returns the value associated with the largest timestamp_prev. If there are no values, it returns "".
Example 1:
Input
["TimeMap", "set", "get", "get", "set", "get", "get"]
[[], ["foo", "bar", 1], ["foo", 1], ["foo", 3], ["foo", "bar2", 4], ["foo", 4], ["foo", 5]]
Output
[null, null, "bar", "bar", null, "bar2", "bar2"]
Explanation
TimeMap timeMap = new TimeMap();
timeMap.set("foo", "bar", 1); // store the key "foo" and value "bar" along with timestamp = 1.
timeMap.get("foo", 1); // return "bar"
timeMap.get("foo", 3); // return "bar", since there is no value corresponding to foo at timestamp 3 and timestamp 2, then the only value is at timestamp 1 is "bar".
timeMap.set("foo", "bar2", 4); // store the key "foo" and value "bar2" along with timestamp = 4.
timeMap.get("foo", 4); // return "bar2"
timeMap.get("foo", 5); // return "bar2"
Constraints:
1 <= key.length, value.length <= 100
key and value consist of lowercase English letters and digits.
1 <= timestamp <= 107
All the timestamps timestamp of set are strictly increasing.
At most 2 * 105 calls will be made to set and get.
Solutions
Solution 1
1 2 3 4 5 6 7 8 910111213141516171819
classTimeMap:def__init__(self):self.ktv=defaultdict(list)defset(self,key:str,value:str,timestamp:int)->None:self.ktv[key].append((timestamp,value))defget(self,key:str,timestamp:int)->str:ifkeynotinself.ktv:return''tv=self.ktv[key]i=bisect_right(tv,(timestamp,chr(127)))returntv[i-1][1]ifielse''# Your TimeMap object will be instantiated and called as such:# obj = TimeMap()# obj.set(key,value,timestamp)# param_2 = obj.get(key,timestamp)
classTimeMap{privateMap<String,TreeMap<Integer,String>>ktv=newHashMap<>();publicTimeMap(){}publicvoidset(Stringkey,Stringvalue,inttimestamp){ktv.computeIfAbsent(key,k->newTreeMap<>()).put(timestamp,value);}publicStringget(Stringkey,inttimestamp){if(!ktv.containsKey(key)){return"";}vartv=ktv.get(key);Integert=tv.floorKey(timestamp);returnt==null?"":tv.get(t);}}/** * Your TimeMap object will be instantiated and called as such: * TimeMap obj = new TimeMap(); * obj.set(key,value,timestamp); * String param_2 = obj.get(key,timestamp); */
classTimeMap{public:TimeMap(){}voidset(stringkey,stringvalue,inttimestamp){ktv[key].emplace_back(timestamp,value);}stringget(stringkey,inttimestamp){auto&pairs=ktv[key];pair<int,string>p={timestamp,string({127})};autoi=upper_bound(pairs.begin(),pairs.end(),p);returni==pairs.begin()?"":(i-1)->second;}private:unordered_map<string,vector<pair<int,string>>>ktv;};/** * Your TimeMap object will be instantiated and called as such: * TimeMap* obj = new TimeMap(); * obj->set(key,value,timestamp); * string param_2 = obj->get(key,timestamp); */
typeTimeMapstruct{ktvmap[string][]pair}funcConstructor()TimeMap{returnTimeMap{map[string][]pair{}}}func(this*TimeMap)Set(keystring,valuestring,timestampint){this.ktv[key]=append(this.ktv[key],pair{timestamp,value})}func(this*TimeMap)Get(keystring,timestampint)string{pairs:=this.ktv[key]i:=sort.Search(len(pairs),func(iint)bool{returnpairs[i].t>timestamp})ifi>0{returnpairs[i-1].v}return""}typepairstruct{tintvstring}/** * Your TimeMap object will be instantiated and called as such: * obj := Constructor(); * obj.Set(key,value,timestamp); * param_2 := obj.Get(key,timestamp); */