前缀树

最新推荐文章于 2025-06-22 23:57:38 发布

楼边斜月为明

最新推荐文章于 2025-06-22 23:57:38 发布

阅读量293

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 java

本文链接：https://blog.csdn.net/zhoumingsong123/article/details/82192925

java 同时被 2 个专栏收录

69 篇文章

订阅专栏

算法

55 篇文章

订阅专栏

class TrieNode{

    char val=' ';
    boolean isWord=false;
    HashMap<Character,TrieNode> hashMap=new HashMap<Character,TrieNode>();
    TrieNode(char c)
    {
        val=c;
    }




}

public class Trie {

    /** Initialize your data structure here. */



    TrieNode root=null;


    public Trie() {

        root=new TrieNode(' ');


    }

    /** Inserts a word into the trie. */
    public void insert(String word) {

        TrieNode trieNode=root;
        for(int i=0;i<word.length();i++)
        {
            TrieNode tN=trieNode.hashMap.get(word.charAt(i));
            if(tN==null)
            {
                tN=new TrieNode(word.charAt(i));
                trieNode.hashMap.put(word.charAt(i),tN);
            }

            trieNode=tN;


        }

        trieNode.isWord=true;




    }

    /** Returns if the word is in the trie. */
    public boolean search(String word) {

         TrieNode trieNode=root;
        for(int i=0;i<word.length();i++)
        {
            TrieNode tN=trieNode.hashMap.get(word.charAt(i));
            if(tN==null)
            {
               return false;
            }
            else
            {
                trieNode=tN;
            }

        }

        if(trieNode.isWord)
        {
            return true;
        }
        else

        {
            return false;
        }





    }

    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {


         TrieNode trieNode=root;
        for(int i=0;i<prefix.length();i++)
        {
            TrieNode tN=trieNode.hashMap.get(prefix.charAt(i));
            if(tN==null)
            {
               return false;
            }
            else
            {
                trieNode=tN;
            }

        }

        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);
 */