981. Time Based Key-Value Store
Create a timebased key-value store class TimeMap, that supports two operations.
1. set(string key, string value, int timestamp)
Stores the
keyandvalue, along with the giventimestamp.
2. get(string key, int timestamp)
Returns a value such that
set(key, value, timestamp_prev)was called previously, withtimestamp_prev <= timestamp.If there are multiple such values, it returns the one with the largest
timestamp_prev.If there are no values, it returns the empty string (
"").
Example 1:
Input: inputs = ["TimeMap","set","get","get","set","get","get"], inputs = [[],["foo","bar",1],["foo",1],["foo",3],["foo","bar2",4],["foo",4],["foo",5]]
Output: [null,null,"bar","bar",null,"bar2","bar2"]
Explanation:
TimeMap kv;
kv.set("foo", "bar", 1); // store the key "foo" and value "bar" along with timestamp = 1
kv.get("foo", 1); // output "bar"
kv.get("foo", 3); // output "bar" since there is no value corresponding to foo at timestamp 3 and timestamp 2, then the only value is at timestamp 1 ie "bar"
kv.set("foo", "bar2", 4);
kv.get("foo", 4); // output "bar2"
kv.get("foo", 5); //output "bar2"
Example 2:
Note:
All key/value strings are lowercase.
All key/value strings have length in the range
[1, 100]The
timestampsfor allTimeMap.setoperations are strictly increasing.1 <= timestamp <= 10^7TimeMap.setandTimeMap.getfunctions will be called a total of120000times (combined) per test case.
解题要点:
先用dict套list的来存key和val,再用binary search来查找合适的key。
Last updated
Was this helpful?