@@ -0,0 +1,1284 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/implement-trie-prefix-tree/%0A */%0Apublic class Problem208 %7B%0A    static class TrieNode %7B%0A        // Initialize your data structure here.%0A        public TrieNode() %7B%0A            %0A        %7D%0A    %7D%0A%0A    public static class Trie %7B%0A        private TrieNode root;%0A%0A        public Trie() %7B%0A            root = new TrieNode();%0A        %7D%0A%0A        // Inserts a word into the trie.%0A        public void insert(String word) %7B%0A            // TODO: implement this%0A        %7D%0A%0A        // Returns if the word is in the trie.%0A        public boolean search(String word) %7B%0A            // TODO: implement this%0A            return false;%0A        %7D%0A%0A        // Returns if there is any word in the trie%0A        // that starts with the given prefix.%0A        public boolean startsWith(String prefix) %7B%0A            // TODO: implement this%0A            return false;%0A        %7D%0A    %7D%0A    %0A    public static void main(String%5B%5D args) %7B%0A        Trie trie = new Trie();%0A        trie.insert(%22something%22);%0A        System.out.println(trie.search(%22something%22));%0A        System.out.println(trie.search(%22some%22));%0A        System.out.println(trie.search(%22blah%22));%0A        System.out.println(trie.startsWith(%22some%22));%0A        System.out.println(trie.startsWith(%22foo%22));%0A    %7D%0A%7D%0A

Add problem 208