leetcode 前缀树trie整理

最新推荐文章于 2024-08-10 22:52:22 发布

林有鹿s

最新推荐文章于 2024-08-10 22:52:22 发布

阅读量69

点赞数

分类专栏： java leecode练习文章标签： leetcode 算法 java

本文链接：https://blog.csdn.net/qq_43788026/article/details/128087039

版权

leecode练习同时被 2 个专栏收录

41 篇文章 1 订阅

订阅专栏

java

5 篇文章 0 订阅

订阅专栏

class Trie {

    Trie[] children;
    boolean isEnd;

    public Trie() {
        children = new Trie[26];
        isEnd = false;
    }
    
    public void insert(String word) {
        Trie node = this;
        for(int i = 0; i < word.length();i++){
            char c = word.charAt(i);
            int index = c - 'a';
            if (node.children[index] == null) {
                node.children[index] = new Trie();
            }
            node = node.children[index]; 
        }
        node.isEnd = true;
    }
    
    public boolean search(String word) {
        Trie node = this;
        for(int i = 0; i < word.length(); i++) {
            char c = word.charAt(i);
            int index = c - 'a';
            if (node.children[index] != null){
                node = node.children[index];
            } else return false;
        }
        if (node.isEnd) return true;
        return false;
    }
    
    public boolean startsWith(String prefix) {
        Trie node = this;
        for(int i = 0; i < prefix.length(); i++) {
            char c = prefix.charAt(i);
            int index = c - 'a';
            if (node.children[index] != null){
                node = node.children[index];
            } else return false;
        }
        return true;
    }
}