208. Implement Trie (Prefix Tree)
Posted 鱼与海洋
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了208. Implement Trie (Prefix Tree)相关的知识,希望对你有一定的参考价值。
Implement a trie with insert
, search
, and startsWith
methods.
Note:
You may assume that all inputs are consist of lowercase letters a-z
.
Show Similar Problems
class TrieNode { // Initialize your data structure here. HashMap<Character, TrieNode> map; boolean isWord; public TrieNode() { map = new HashMap<Character, TrieNode>(); isWord = false; } } public class Trie { private TrieNode root; public Trie() { root = new TrieNode(); } // Inserts a word into the trie. public void insert(String word) { TrieNode it = root; for(char c : word.toCharArray()){ if(!it.map.containsKey(c)){ it.map.put(c , new TrieNode() ); } it = it.map.get(c); } it.isWord = true; } // Returns if the word is in the trie. public boolean search(String word) { TrieNode it = root; for(char c : word.toCharArray()){ if(!it.map.containsKey(c)){ return false; } it = it.map.get(c); } return it.isWord; } // Returns if there is any word in the trie // that starts with the given prefix. public boolean startsWith(String prefix) { TrieNode it = root; for(char c : prefix.toCharArray()){ if(!it.map.containsKey(c)){ return false; } it = it.map.get(c); } return true; } } // Your Trie object will be instantiated and called as such: // Trie trie = new Trie(); // trie.insert("somestring"); // trie.search("key");
以上是关于208. Implement Trie (Prefix Tree)的主要内容,如果未能解决你的问题,请参考以下文章
208. Implement Trie (Prefix Tree)
208. Implement Trie (Prefix Tree)
208. Implement Trie (Prefix Tree)
208. Implement Trie (Prefix Tree)