Leetcode 208. Implement Trie (Prefix Tree) Trie树（前缀树）

208. Implement Trie (Prefix Tree) Medium Implement a trie with insert, search, and startsWith methods. Example: Trie trie = new Trie(); trie.insert(“apple”); trie.search(“apple”); // returns true trie

>>阅读原文<<