标签：sea col ons nbsp instant lse div param insert
Implement a trie with insert, search, and startsWith methods.
Example:
Trie trie = new Trie();
trie.insert("apple");
trie.search("apple"); // returns true
trie.search("app"); // returns false
trie.startsWith("app"); // returns true
trie.insert("app");
trie.search("app"); // returns true
Note:
a-z.class Trie { Set<String> list; /** Initialize your data structure here. */ public Trie() { list = new HashSet(); } /** Inserts a word into the trie. */ public void insert(String word) { list.add(word); } /** Returns if the word is in the trie. */ public boolean search(String word) { return list.contains(word); } /** Returns if there is any word in the trie that starts with the given prefix. */ public boolean startsWith(String prefix) { for(String s : list){ if(s.startsWith(prefix)) return true; } return false; } } /** * 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); */
208. Implement Trie (Prefix Tree)
标签：sea col ons nbsp instant lse div param insert
原文地址：https://www.cnblogs.com/wentiliangkaihua/p/11888707.html
