题目
创建一个基于时间的键值存储类 TimeMap,它支持下面两个操作:
- set(string key, string value, int timestamp)
– 存储键 key、值 value,以及给定的时间戳 timestamp。 - get(string key, int timestamp)
– 返回先前调用 set(key, value, timestamp_prev) 所存储的值,其中 timestamp_prev <= timestamp。
– 如果有多个这样的值,则返回对应最大的 timestamp_prev 的那个值。
– 如果没有值,则返回空字符串("")。
示例一
输入:inputs = ["TimeMap","set","get","get","set","get","get"], inputs = [[],["foo","bar",1],["foo",1],["foo",3],["foo","bar2",4],["foo",4],["foo",5]]
输出:[null,null,"bar","bar",null,"bar2","bar2"]
解释:
TimeMap kv;
kv.set("foo", "bar", 1); // 存储键 "foo" 和值 "bar" 以及时间戳 timestamp = 1
kv.get("foo", 1); // 输出 "bar"
kv.get("foo", 3); // 输出 "bar" 因为在时间戳 3 和时间戳 2 处没有对应 "foo" 的值,所以唯一的值位于时间戳 1 处(即 "bar")
kv.set("foo", "bar2", 4);
kv.get("foo", 4); // 输出 "bar2"
kv.get("foo", 5); // 输出 "bar2"
示例2
输入:inputs = ["TimeMap","set","set","get","get","get","get","get"], inputs = [[],["love","high",10],["love","low",20],["love",5],["love",10],["love",15],["love",20],["love",25]]
输出:[null,null,null,"","high","high","low","low"]
题解
哈希表加二分法
class TimeMap {
class Node {
String k, v;
int t;
Node (String _k, String _v, int _t) {
k = _k; v = _v; t = _t;
}
}
Map<String, List<Node>> map = new HashMap<>();
public void set(String k, String v, int t) {
List<Node> list = map.getOrDefault(k, new ArrayList<>());
list.add(new Node(k, v, t));
map.put(k, list);
}
public String get(String k, int t) {
List<Node> list = map.getOrDefault(k, new ArrayList<>());
if (list.isEmpty()) return "";
int n = list.size();
int l = 0, r = n - 1;
while (l < r) {
int mid = (l + r + 1) >> 1;
if (list.get(mid).t <= t) { // 二分法找t
l = mid;
} else {
r = mid - 1;
}
}
return list.get(r).t <= t ? list.get(r).v : ""; // 最后右指针指向的节点的t仍然更大说明没有符合条件的
}
}
哈希表套树
class TimeMap {
private Map<String, TreeSet<Object[]>> map;
public TimeMap() {
map = new HashMap<>();
}
public void set(String key, String value, int timestamp) {
TreeSet<Object[]> test = map.getOrDefault(key, new TreeSet<Object[]>((x,y)->{
return (int)x[1] - (int)y[1];
})); // 自定义比较器
test.add(new Object[]{value, timestamp});
if(!map.containsKey(key))
map.put(key, test);
}
public String get(String key, int timestamp) {
if(map.containsKey(key)){
Object[] obj = map.get(key).floor(new Object[]{"obj", timestamp}); // floor返回Set中 <= e的最大元素
if(obj != null) return (String)obj[0];
}
return "";
}
}