677. 键值映射
设计一个 map ，满足以下几点:
实现一个 MapSum 类：
MapSum() 初始化 MapSum 对象void insert(String key, int val) 插入 key-val 键值对，字符串表示键 key ，整数表示值 val 。如果键 key 已经存在，那么原来的键值对 key-value 将被替代成新的键值对。int sum(string prefix) 返回所有以该前缀 prefix 开头的键 key 的值的总和。
示例 1：
输入：
["MapSum", "insert", "sum", "insert", "sum"]
[[], ["apple", 3], ["ap"], ["app", 2], ["ap"]]
输出：
[null, null, 3, null, 5]
解释：
MapSum mapSum = new MapSum();
mapSum.insert("apple", 3);
mapSum.sum("ap"); // 返回 3 (apple = 3)
mapSum.insert("app", 2);
mapSum.sum("ap"); // 返回 5 (apple + app = 3 + 2 = 5)
提示：
1 <= key.length, prefix.length <= 50key 和 prefix 仅由小写英文字母组成1 <= val <= 100050 次 insert 和 sum原站题解
python3 解法, 执行用时: 36 ms, 内存消耗: 15 MB, 提交时间: 2022-11-17 16:32:36
'''
暴力扫描
'''
class MapSum:
def __init__(self):
self.map = {}
def insert(self, key: str, val: int) -> None:
self.map[key] = val
def sum(self, prefix: str) -> int:
res = 0
for key,val in self.map.items():
if key.startswith(prefix):
res += val
return res
# Your MapSum object will be instantiated and called as such:
# obj = MapSum()
# obj.insert(key,val)
# param_2 = obj.sum(prefix)
python3 解法, 执行用时: 40 ms, 内存消耗: 15 MB, 提交时间: 2022-11-17 16:31:06
class MapSum:
def __init__(self):
self.map = {}
self.prefixmap = {}
def insert(self, key: str, val: int) -> None:
delta = val
if key in self.map:
delta -= self.map[key]
self.map[key] = val
for i in range(len(key)):
currprefix = key[0:i+1]
if currprefix in self.prefixmap:
self.prefixmap[currprefix] += delta
else:
self.prefixmap[currprefix] = delta
def sum(self, prefix: str) -> int:
if prefix in self.prefixmap:
return self.prefixmap[prefix]
else:
return 0
# Your MapSum object will be instantiated and called as such:
# obj = MapSum()
# obj.insert(key,val)
# param_2 = obj.sum(prefix)