问题:
Implement a MapSum class with insert, and sum methods.
For the method insert, you'll be given a pair of (string, integer). The string represents the key and the integer represents the value. If the key already existed, then the original key-value pair will be overridden to the new one.
For the method sum, you'll be given a string representing the prefix, and you need to return the sum of all the pairs' value whose key starts with the prefix.
Example 1:
Input: insert("apple", 3), Output: Null
Input: sum("ap"), Output: 3
Input: insert("app", 2), Output: Null
Input: sum("ap"), Output: 5
解决:
使用insert和sum方法实现MapSum类。 对于插入方法,您将得到一对(字符串,整数)。字符串表示键,整数表示该值。如果密钥已经存在,那么原来的密钥对将被覆盖。 对于方法总和,您将得到一个表示前缀的字符串,您需要返回所有键的值以前缀开头的值的总和。
① 直接用Map实现。
class MapSum { //123ms
Map map;
/** Initialize your data structure here. */
public MapSum() {
map = new HashMap<>();
}
public void insert(String key, int val) {
map.put(key,val);
}
public int sum(String prefix) {
int res = 0;
for (String key : map.keySet()){
if (key.startsWith(prefix)){
res += map.get(key);
}
}
return res;
}
}
/**
* Your MapSum object will be instantiated and called as such:
* MapSum obj = new MapSum();
* obj.insert(key,val);
* int param_2 = obj.sum(prefix);
*/