refactor 208

fishercoder1534 · fishercoder1534 · commit 3b5b8873a499 · 2020-07-05T14:22:36.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_208.java b/src/main/java/com/fishercoder/solutions/_208.java
@@ -3,34 +3,23 @@
 public class _208 {
     public static class Solution1 {
         public static class TrieNode {
-
-            char val;
             boolean isWord;
             TrieNode[] children = new TrieNode[26];
-
-            // Initialize your data structure here.
-            public TrieNode() {
-            }
-
-            public TrieNode(char c) {
-                this.val = c;
-            }
         }
 
         public static class Trie {
             private TrieNode root;
 
             public Trie() {
-                root = new TrieNode();
-                root.val = ' ';//initialize root to be an empty char, this is a common practice as how Wiki defines Trie data structure as well
+                root = new TrieNode();//initialize root to be an empty char, this is a common practice as how Wiki defines Trie data structure as well
             }
 
             // Inserts a word into the trie.
             public void insert(String word) {
                 TrieNode node = root;
                 for (int i = 0; i < word.length(); i++) {
                     if (node.children[word.charAt(i) - 'a'] == null) {
-                        node.children[word.charAt(i) - 'a'] = new TrieNode(word.charAt(i));
+                        node.children[word.charAt(i) - 'a'] = new TrieNode();
                     }
                     node = node.children[word.charAt(i) - 'a'];
                 }
diff --git a/src/test/java/com/fishercoder/_208Test.java b/src/test/java/com/fishercoder/_208Test.java
@@ -19,4 +19,19 @@ public void test1() {
         assertEquals(true, trie.search("app"));
     }
 
+    @Test
+    public void test2() {
+        trie = new _208.Solution1.Trie();
+        trie.insert("fisher");
+        trie.insert("coder");
+        trie.insert("apple");
+        trie.insert("april");
+        trie.insert("cad");
+        assertEquals(true, trie.search("fisher"));
+        assertEquals(true, trie.search("apple"));
+        assertEquals(true, trie.search("coder"));
+        assertEquals(true, trie.search("april"));
+        assertEquals(true, trie.search("cad"));
+    }
+
 }
