refactor 208

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_208.java

@@ -1,78 +1,80 @@
 package com.fishercoder.solutions;
 
 /**
- *
  * 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.*/
+ You may assume that all inputs are consist of lowercase letters a-z.
+ */
 
 public class _208 {
-    class TrieNode {
+    public static class Solution1 {
+        class TrieNode {
 
-        char val;
-        boolean isWord;
-        TrieNode[] children = new TrieNode[26];
+            char val;
+            boolean isWord;
+            TrieNode[] children = new TrieNode[26];
 
-        // Initialize your data structure here.
-        public TrieNode() {
-        }
+            // Initialize your data structure here.
+            public TrieNode() {
+            }
 
-        public TrieNode(char c) {
-            this.val = c;
+            public TrieNode(char c) {
+                this.val = c;
+            }
         }
-    }
 
-    public class Trie {
-        private TrieNode root;
+        public 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
-        }
+            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
+            }
 
-        // 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));
+            // 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 = node.children[word.charAt(i) - 'a'];
                 }
-                node = node.children[word.charAt(i) - 'a'];
+                node.isWord = true;
             }
-            node.isWord = true;
-        }
 
-        // Returns if the word is in the trie.
-        public boolean search(String word) {
-            TrieNode node = root;
-            for (int i = 0; i < word.length(); i++) {
-                if (node.children[word.charAt(i) - 'a'] == null) {
-                    return false;
+            // Returns if the word is in the trie.
+            public boolean search(String word) {
+                TrieNode node = root;
+                for (int i = 0; i < word.length(); i++) {
+                    if (node.children[word.charAt(i) - 'a'] == null) {
+                        return false;
+                    }
+                    node = node.children[word.charAt(i) - 'a'];
                 }
-                node = node.children[word.charAt(i) - 'a'];
+                return node.isWord;
             }
-            return node.isWord;
-        }
 
-        // Returns if there is any word in the trie
-        // that starts with the given prefix.
-        public boolean startsWith(String prefix) {
-            TrieNode node = root;
-            for (int i = 0; i < prefix.length(); i++) {
-                if (node.children[prefix.charAt(i) - 'a'] == null) {
-                    return false;
+            // Returns if there is any word in the trie
+            // that starts with the given prefix.
+            public boolean startsWith(String prefix) {
+                TrieNode node = root;
+                for (int i = 0; i < prefix.length(); i++) {
+                    if (node.children[prefix.charAt(i) - 'a'] == null) {
+                        return false;
+                    }
+                    node = node.children[prefix.charAt(i) - 'a'];
                 }
-                node = node.children[prefix.charAt(i) - 'a'];
+                return true;
             }
-            return true;
         }
-    }
 
-    // Your Trie object will be instantiated and called as such:
-    // Trie trie = new Trie();
-    // trie.insert("somestring");
-    // trie.search("key");
+        // Your Trie object will be instantiated and called as such:
+        // Trie trie = new Trie();
+        // trie.insert("somestring");
+        // trie.search("key");
+    }
 }