-
Notifications
You must be signed in to change notification settings - Fork 0
/
MapSum.java
98 lines (83 loc) · 2.47 KB
/
MapSum.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
package will.zhang.UsingTrie.MapSumPairs677;
import java.util.HashMap;
/**
* LeetCode 677. 键值映射
* 实现一个 MapSum 类里的两个方法,insert 和 sum。
*
* 对于方法 insert,你将得到一对(字符串,整数)的键值对。字符串表示键,整数表示值。如果键已经存在,那么原来的键值对将被替代成新的键值对。
*
* 对于方法 sum,你将得到一个表示前缀的字符串,你需要返回所有以该前缀开头的键的值的总和。
* 示例 1:
*
* 输入: insert("apple", 3), 输出: Null
* 输入: sum("ap"), 输出: 3
* 输入: insert("app", 2), 输出: Null
* 输入: sum("ap"), 输出: 5
*/
public class MapSum {
//根节点
private Node root;
private class Node {
public int value;
//每一个节点的next都是TreeMap
private HashMap<Character, Node> next;
public Node(int value){
this.value = value;
next = new HashMap<>();
}
public Node(){
this(0);
}
}
/** Initialize your data structure here. */
public MapSum() {
root = new Node();
}
public void insert(String word, int val) {
Node cur = root;
for (int i = 0; i < word.length(); i++) {
char c = word.charAt(i);
if(cur.next.get(c) == null){
cur.next.put(c, new Node());
}
cur = cur.next.get(c);
}
cur.value = val;
}
public int sum(String prefix) {
Node cur = root;
for (int i = 0; i < prefix.length(); i++) {
char c = prefix.charAt(i);
if(cur.next.get(c) == null){
return 0;
}
cur = cur.next.get(c);
}
return sum(cur);
}
/**
* 计算以node为根的总分
* @param node
* @return
*/
private int sum(Node node){
int result = node.value;
for (Character character : node.next.keySet()) {
result += sum(node.next.get(character));
}
return result;
}
public static void main(String[] args) {
MapSum mapSum = new MapSum();
mapSum.insert("apple", 3);
System.out.println(mapSum.sum("ap"));
mapSum.insert("app", 2);
System.out.println(mapSum.sum("ap"));
}
}
/**
* Your MapSum object will be instantiated and called as such:
* MapSum obj = new MapSum();
* obj.insert(key,val);
* int param_2 = obj.sum(prefix);
*/