字典树(Trie)也称为前缀树。核心思想是通过多个字符串的公共部分来减少搜索时间,以空间换时间。
本篇实现以数组的形式编写字典树
字典树核心思想图:
class Node {
public Node[] children;
public int flag;
private final int CHARNUM = 26;
public Node(){
children = new Node[CHARNUM];
for(int i=0; i<CHARNUM; i++){
children[i] = null;
}
flag = -1;
}
}
public void insert(String str, int flag){
Node pad = TrieNodes.get(0);
for(int i=0; i<str.length(); i++){
int cur = str.charAt(i) - 'a';
if(pad.children[cur] == null){
TrieNodes.add(new Node());
pad.children[cur] = TrieNodes.get(TrieNodes.size() - 1);
}
pad = pad.children[cur];
}
pad.flag = flag;
}
public int search(String str, int flag){
Node pad = TrieNodes.get(0);
for(int i=0; i<str.length(); i++){
int cur = str.charAt(i) - 'a';
if(pad.children[cur] == null){
return -1;
}
pad = pad.children[cur];
}
return pad.flag;
}
public void init(){
//Add the first
TrieNodes.add(new Node());
}