forked from IvanLu1024/Java-Notes
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMapSum.java
More file actions
66 lines (58 loc) · 1.42 KB
/
Copy pathMapSum.java
File metadata and controls
66 lines (58 loc) · 1.42 KB
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
package code_08_trie;
/**
* Created by 18351 on 2018/12/28.
*/
public class MapSum {
private class Node{
public Node[] next;
public int value;
public Node(int value){
this.next=new Node[26];
this.value=value;
}
public Node(){
this(0);
}
}
private Node root;
/** Initialize your data structure here. */
public MapSum() {
root=new Node();
}
public void insert(String key, int val) {
Node cur=root;
for(int i=0;i<key.length();i++){
char c=key.charAt(i);
if(cur.next[c-'a']==null){
cur.next[c-'a']=new Node();
}
cur=cur.next[c-'a'];
}
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[c-'a']==null){
return 0;
}
cur=cur.next[c-'a'];
}
return sum(cur);
}
private int sum(Node node){
//说明node是叶子结点
if(node.next==null){
return node.value;
}
int res=node.value;
//node.next 是当前结点的所有的后继结点
for(Node nextNode:node.next){
if(nextNode!=null){
res+=sum(nextNode);
}
}
return res;
}
}