20200406——第二百零八题实现Trie-CSDN博客

本文链接：https://blog.csdn.net/qq_36344771/article/details/105353279

本文深入探讨了Trie树数据结构的实现细节，包括初始化、插入单词、搜索单词及前缀匹配等功能。通过具体代码示例，展示了如何使用Trie树进行高效字符串操作，特别强调了布尔值is_String在判断字符结尾的重要作用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class Trie {

    private boolean is_string = false;
    private Trie[] next = new Trie[26];
    /** Initialize your data structure here. */
    public Trie() {

    }
    
    /** Inserts a word into the trie. */
    public void insert(String word) {
        Trie root = this;
        char w[] = word.toCharArray();
        for(int i = 0;i<w.length;++i){
            if(root.next[w[i]-'a'] == null){
                root.next[w[i] - 'a'] = new Trie();
            }
            root = root.next[w[i]- 'a'];
        }
        root.is_string = true;
    }
    
    /** Returns if the word is in the trie. */
    public boolean search(String word) {
        Trie root = this;
        char w[] = word.toCharArray();
        for(int i = 0 ;i<w.length;++i){
            if(root.next[w[i] - 'a']==null){
                return false;
            }
            root =root.next[w[i]-'a'];
        }
        return root.is_string;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {
        Trie root = this;
        char w[]= prefix.toCharArray();
        for(int i = 0;i<w.length;++i){
            if(root.next[w[i] - 'a'] ==null){
                return false;
            }
            root = root.next[w[i] - 'a'];
        }
        return true;
    }
}

/**
 * Your Trie object will be instantiated and called as such:
 * Trie obj = new Trie();
 * obj.insert(word);
 * boolean param_2 = obj.search(word);
 * boolean param_3 = obj.startsWith(prefix);
 */