677. Map Sum Pairs
2018-01-25 14:19
316 查看
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:
思路:
For each key in the map, if that key starts with the given prefix, then add it to the answer.
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
思路:
For each key in the map, if that key starts with the given prefix, then add it to the answer.
class MapSum { HashMap<String, Integer> 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 ans = 0; for (String key: map.keySet()) { if (key.startsWith(prefix)) { ans += map.get(key); } } return ans; } } /** * Your MapSum object will be instantiated and called as such: * MapSum obj = new MapSum(); * obj.insert(key,val); * int param_2 = obj.sum(prefix); */
相关文章推荐
- leetcode 677. Map Sum Pairs
- 677. Map Sum Pairs
- LWC 50:677. Map Sum Pairs
- Map Sum Pairs
- 677. Map Sum Pairs
- Map Sum Pairs问题及解法
- 第14周Map Sum Pairs
- [LeetCode] Map Sum Pairs 映射配对之和
- light oj 1236 - Pairs Forming LCM & uva 12546 - LCM Pair Sum
- 《LeetBook》LeetCode题解(1) : Two Sum[E]——哈希Map的应用
- find all pairs of elements in a balanced BST that sum to a certain number
- Find K Pairs with Smallest Sum
- geeksforgeeks@ Find sum of different corresponding bits for all pairs (Bit manipulation)
- poj 1185 炮兵阵地 状态压缩+dp sum dp,s,Map
- 【数论】【二次剩余】【map】hdu6128 Inverse of sum
- Incorrect inline parameter map format (missmatched name=value pairs)
- LeetCode 1.Two Sum map 初次使用Markdown*****
- 2016.07.13-map的使用(以leetcode1-Two Sum为例)
- Rust : codewars的Sum of Pairs
- 未完成--Sum of Pairs