-
Notifications
You must be signed in to change notification settings - Fork 38
/
Copy pathMapSumii.java
66 lines (58 loc) · 1.44 KB
/
MapSumii.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
class MapSum {
class TrieNode
{
Map<Character, TrieNode> children;
int value;
boolean isWord;
public TrieNode()
{
children = new HashMap<>();
value = 0;
isWord = false;
}
}
TrieNode root;
/** Initialize your data structure here. */
public MapSum() {
root = new TrieNode();
}
public void insert(String key, int val) {
TrieNode cur = root;
for(char c:key.toCharArray())
{
TrieNode next = cur.children.get(c);
if(next == null)
{
next = new TrieNode();
cur.children.put(c, next);
}
cur = next;
}
cur.isWord = true;
cur.value = val;
}
public int sum(String prefix) {
TrieNode cur = root;
for(char c:prefix.toCharArray())
{
TrieNode next = cur.children.get(c);
if(next == null)
return 0;
cur = next;
}
return dfs(cur);
}
public int dfs(TrieNode cur)
{
int sum = 0;
for(char c:cur.children.keySet())
sum += dfs(cur.children.get(c));
return sum+cur.value;
}
}
/**
* Your MapSum object will be instantiated and called as such:
* MapSum obj = new MapSum();
* obj.insert(key,val);
* int param_2 = obj.sum(prefix);
*/