981.py

'''
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 ("").
'''

importbisect
classTimeMap(object):

def__init__(self):
"""
 Initialize your data structure here.
 """
self.time_dict= {}
self.key_map= {}


defset(self, key, value, timestamp):
"""
 :type key: str
 :type value: str
 :type timestamp: int
 :rtype: None
 """
ifkeyinself.time_dict:
self.time_dict[key].append(timestamp)
self.key_map[key].append(value)
else:
self.time_dict[key] = [timestamp]
self.key_map[key] = [value]




defget(self, key, timestamp):
"""
 :type key: str
 :type timestamp: int
 :rtype: str
 """
ifkeyinself.time_dict:
t_values=self.time_dict[key]
index=bisect.bisect_right(t_values, timestamp)
ifindex-1==len(t_values) orindex==0:
return''

returnself.key_map[key][index-1]



# Your TimeMap object will be instantiated and called as such:
# obj = TimeMap()
# obj.set(key,value,timestamp)
# param_2 = obj.get(key,timestamp)