看到trie树的原理以及应用,自己动手写一个例子,以便记忆;
import java.util.*;
/**
* trie树 应用(trie 树也称为字典树、单词查找树,最大的特点就是共享字符串的公共前缀来达到节省空间的目的了)
*/
public class TrieTree {
//trie树
HashMap<Character,HashMap> trie = new HashMap<>();
/**
* 向字典树trie中添加关键词
* @param a 关键词
*/
public void addSensitiveWord(String a){
//从字典中获取第一个字符的子节点
HashMap<Character,HashMap> cuurentT = trie.get(a.charAt(0));
//如果为空,则证明该树中第一层级的子节点中不存在a的第一个字符
if(cuurentT==null){
//那么就创建一个hashmap放入到根节点下
cuurentT = new HashMap<>();
trie.put(a.charAt(0),cuurentT);
}
//从字符串a的下标为1的字符开始
for(int i=1;i<a.length();i++){
//此时将父级节点置为a的上一个字符的子节点
HashMap<Character,HashMap> parent = cuurentT;
//查找其第一个字符子节点中是否存在a的第i个字符
cuurentT = cuurentT.get(a.charAt(i));
//如果不存在就放入
if(cuurentT==null){
cuurentT = new HashMap<>();
parent.put(a.charAt(i),cuurentT);
}
}
}
/**
* 过滤敏感词汇
*
* @param msg 需要过滤的字符串
* @return 返回过滤后的结果
*/
public String filter(String msg){
int j=0;
char[] msgs = msg.toCharArray();
HashMap<Character,HashMap> parent = trie;
for(int i=0;i<msgs.length;i++){
HashMap<Character,HashMap> currentL = parent.get(msgs[i]);
if(currentL!=null){
parent = currentL;
if(currentL.size()==0){
while (i-j>=0){
msgs[j] = '*';
j++;
}
}
continue;
}else {
parent = trie;
j=i;
}
}
return new String(msgs);
}
/**
* 根据开始文字,获取提示词
* @param start 开始文字
* @return 返回提示词的集合
*/
public List<String> getTips(String start){
List<String> res = new LinkedList<>();
char[] msgs = start.toCharArray();
HashMap<Character,HashMap> parent = trie;
HashMap<Character,HashMap> cuurentL = null;
for(int i=0;i<msgs.length;i++){
cuurentL = parent.get(msgs[i]);
if(cuurentL==null){
parent = null;
break;
}
parent = cuurentL;
}
if(parent==null){
return null;
}else {
getTipsOfHashMap(res,parent,"");
}
return res;
}
/**
* 递归获取trie树的每一链路的key值的组合值的集合
* @param res
* @param a
* @param b
*/
public void getTipsOfHashMap(List<String> res ,HashMap<Character,HashMap> a,String b){
if(a.size()==0){
res.add(b);
}else {
Set<Character> as = a.keySet();
Iterator aIt = as.iterator();
while (aIt.hasNext()){
Character key = (Character) aIt.next();
getTipsOfHashMap(res,a.get(key),b+key);
}
}
}
public static void main(String[] args) {
TrieTree trieTree = new TrieTree();
for(int i = 0;i<100000;i++){
trieTree.addSensitiveWord(i+"天下第一");
trieTree.addSensitiveWord(i+"天下无敌");
trieTree.addSensitiveWord(i+"天下天下");
trieTree.addSensitiveWord(i+"为天下第一");
trieTree.addSensitiveWord(i+"我的天下无敌");
trieTree.addSensitiveWord(i+"哈哈天下天下");
trieTree.addSensitiveWord("天下第一"+i);
trieTree.addSensitiveWord("天下无敌"+i);
trieTree.addSensitiveWord("天下天下"+i);
trieTree.addSensitiveWord("为天下第一"+i);
trieTree.addSensitiveWord("我的天下无敌"+i);
trieTree.addSensitiveWord("哈哈天下天下"+i);
}
List<String> res = trieTree.getTips("1天下");
for(String s:res){
System.out.println("1天下"+s);
}
System.out.println(trieTree.filter("1天下第一1我就是"));
System.out.println(trieTree.trie.size());
}
}