LeetCode每日一题(981. Time Based Key-Value Store)

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.

---

这就是个考验二分搜索的题目， 对时间进行二分搜索， 找到<=timestamp 的值， 但是我对二分搜索的理解仅限于套公式来用， 剩下的就只能是头疼医头脚疼医脚了， 所以代码实现很不优雅， 有待改进

---

use std::collections::HashMap;

struct TimeMap {
    m: HashMap<String, Vec<(i32, String)>>,
}

impl TimeMap {
    fn new() -> Self {
        Self { m: HashMap::new() }
    }

    fn set(&mut self, key: String, value: String, timestamp: i32) {
        self.m
            .entry(key)
            .or_insert(Vec::new())
            .push((timestamp, value));
    }

    fn get(&self, key: String, timestamp: i32) -> String {
        if let Some(l) = self.m.get(&key) {
            let mut low = 0;
            let mut high = l.len() - 1;
            while low < high {
                let mid = (low + high) / 2;
                if l[mid].0 > timestamp {
                    high = mid;
                    continue;
                }
                if l[mid].0 == timestamp {
                    low = mid;
                    break;
                }
                low = mid + 1;
            }
            if l[low].0 <= timestamp {
                return l[low].1.clone();
            }
            if low > 0 {
                return l[low - 1].1.clone();
            }
        }
        "".into()
    }
}