Trie的相关情况
适用于字符串的相关查询,查询只与字符串的长度相关。
Trie的结构情况
里面有一个内部的节点,如下,考录到用map主要是子节点的个数不是很确定。
private class Node{
boolean isWord;
Map<Character,Node> next;
public Node(boolean isWord) {
this.isWord = isWord;
next = new HashMap<>();
}
public Node() {
this(false);
}
}
添加的情况。
//向tire中添加一个新的单词
public void add(String str){
Node cur = root;
for (int i = 0; i < str.length(); i++) {
char charAt = str.charAt(i);
//如果不包含
if (!cur.next.containsKey(charAt)) {
cur.next.put(charAt, new Node());
}
cur=cur.next.get(charAt);
}
//说明不是结尾,此时说明是新建的
if(!cur.isWord){
cur.isWord =true;
size++;
}
}
查询的情况
//查询tire中的一个单词
public boolean contain(String str){
Node cur = root;
for (int i = 0; i < str.length(); i++) {
char charAt = str.charAt(i);
if(!cur.next.containsKey(charAt)){
return false;
}
cur = cur.next.get(charAt);
}
return cur.isWord;
}
LeetCode上相关的习题
实现一个 Trie (前缀树),包含 insert, search, 和 startsWith 这三个操作。
示例:
Trie trie = new Trie();
trie.insert(“apple”);
trie.search(“apple”); // 返回 true
trie.search(“app”); // 返回 false
trie.startsWith(“app”); // 返回 true
trie.insert(“app”);
trie.search(“app”); // 返回 true
class Trie {
private Node root;
//定义一个用于前缀书需要的类
private class Node{
boolean isWord;
Map<Character,Node> next;
public Node(boolean isWord){
this.isWord = isWord;
next = new HashMap<>();
}
public Node(){
this(false);
}
}
/** Initialize your data structure here. */
public Trie() {
root = new Node();
}
/** Inserts a word into the trie. */
public void insert(String word) {
Node cur = root;
for(int i = 0;i<word.length();i++){
char c = word.charAt(i);
if(!cur.next.containsKey(c)){
cur.next.put(c,new Node());
}
cur = cur.next.get(c);
}
//标识该数据是末尾
cur.isWord = true;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
Node cur = root;
for(int i = 0;i<word.length();i++){
char c = word.charAt(i);
if(!cur.next.containsKey(c)){
return false;
}
cur = cur.next.get(c);
}
return cur.isWord;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
Node cur = root;
for(int i = 0;i<prefix.length();i++){
char c = prefix.charAt(i);
if(!cur.next.containsKey(c)){
return false;
}
cur = cur.next.get(c);
}
return true;
}
}