反向迭代器reverse_iterator

最新推荐文章于 2025-03-10 21:16:08 发布

独孤金泽

最新推荐文章于 2025-03-10 21:16:08 发布

阅读量271

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_35747066/article/details/89432370

本文介绍了一种时间基键值存储的数据结构实现，包括两个主要操作：设置和获取。通过实例展示了如何存储键值对并根据时间戳检索最近的值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

981. Time Based Key-Value Store

Medium

13324FavoriteShare

Create a timebased key-value store class TimeMap, that supports two operations.

1. set(string key, string value, int timestamp)

Stores the key and value, along with the given timestamp.

2. get(string key, int timestamp)

Returns a value such that set(key, value, timestamp_prev) was called previously, with timestamp_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:

Input: 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]]
Output: [null,null,null,"","high","high","low","low"]

class TimeMap {
public:
    /** Initialize your data structure here. */
    TimeMap() {
        
    }
    
    void set(string key, string value, int timestamp) {
        Map[key][timestamp] = value;
    }
    
    string get(string key, int timestamp) {
        string Result = "";
        if(Map.count(key) == 0){
            return Result;
        }
        if(Map[key].count(timestamp) != 0){
            Result = Map[key][timestamp];
            return Result;
        }
        map<int,string>::reverse_iterator it = Map[key].rbegin();
        for(it;it != Map[key].rend();it++){
            if(it->first > timestamp){
                continue;
            }
            Result = it->second;
            return Result;
        }
        return Result;
    }
    private:
        unordered_map<string,map<int,string>> Map;
};

/**
 * 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);
 */