LeetCode 981 基于时间的“键-值”存储

1 题目描述

创建一个基于时间的“键-值”存储类TimeMap,其支持两类操作:

  • a)set(string key, string value, int timestamp) 与timestamp一起,存储key, value。

  • b)get(string key, int timestamp)

    • 返回一个之前设置的值,如set(key, value, timestamp_prev),满足timestamp_prev <= timestamp;

    • 若满足情况的值有多个,返回对应最大的timestamp_prev;

    • 若没有满足情况的值,返回一个空字符串""。

例子1:

输入:
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); // 与timestamp = 1一起,存储键"foo",值"bar"  
kv.get("foo", 1);  // 输出"bar"   
kv.get("foo", 3); // 输出"bar",因键"foo"在timestamp 3及timestamp 2没有值,仅有的值是在timestamp 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"]

注:

a)所有的键值字符串均为小写字母;

b)所有的键值字符串长度位于区间[1, 100];

c)对于所有TimeMap.set操作的timestamp是严格递增的;

d)1 <= timestamp <= 10^7;

e)TimeMap.set及TimeMap.get函数在每个测试用例将被调用120000次。

题目出处:LeetCode

2 解决思路

使用两个map,一个是timestamps,key存键,value是一个slice,存时间戳(递增)。

另一个map是values,key是时间戳,value存值。

这样,对于给定key与timestamp进行Get时,先遍历第一个map找到满足条件的时间戳,然后用第二个map直接读出值即可。

3 Golang实现代码

https://github.com/olzhy/

type TimeMap struct {
    timestamps map[string][]int
    values     map[int]string
}

func Constructor() TimeMap {
    return TimeMap{make(map[string][]int), make(map[int]string)}
}

func (this *TimeMap) Set(key string, value string, timestamp int) {
    this.timestamps[key] = append(this.timestamps[key], timestamp)
    this.values[timestamp] = value
}

func (this *TimeMap) Get(key string, timestamp int) string {
    if timestamps, ok := this.timestamps[key]; ok {
        for i := len(timestamps) - 1; i >= 0; i-- {
            if timestamp >= timestamps[i] {
                return this.values[timestamps[i]]
            }
        }
    }
    return ""
}
创作不易,如果我的文章确实帮助到了您,请我喝点东西就是一种莫大的支持!Thanks!
微信支付宝