refactor 212

fishercoder1534 · fishercoder1534 · commit fe109368edc3 · 2018-09-21T07:35:03.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_212.java b/src/main/java/com/fishercoder/solutions/_212.java
@@ -30,66 +30,67 @@
  If you would like to learn how to implement a basic trie, please work on this problem: Implement Trie (Prefix Tree) first.*/
 public class _212 {
 
-    public List<String> findWords(char[][] board, String[] words) {
-        TrieNode root = buildTrie(words);
-        List<String> result = new ArrayList();
-        for (int i = 0; i < board.length; i++) {
-            for (int j = 0; j < board[0].length; j++) {
-                dfs(root, board, i, j, result);
+    public static class Solution1 {
+        public List<String> findWords(char[][] board, String[] words) {
+            TrieNode root = buildTrie(words);
+            List<String> result = new ArrayList();
+            for (int i = 0; i < board.length; i++) {
+                for (int j = 0; j < board[0].length; j++) {
+                    dfs(root, board, i, j, result);
+                }
             }
+            return result;
         }
-        return result;
-    }
 
-    private void dfs(TrieNode root, char[][] board, int i, int j, List<String> result) {
-        char c = board[i][j];
+        private void dfs(TrieNode root, char[][] board, int i, int j, List<String> result) {
+            char c = board[i][j];
 
-        if (c == '#' || root.children[c - 'a'] == null) {
-            return;
-        }
+            if (c == '#' || root.children[c - 'a'] == null) {
+                return;
+            }
 
-        if (root.children[c - 'a'].word != null) {
-            result.add(root.children[c - 'a'].word);
-            root.children[c - 'a'].word = null;//de-duplicate
-        }
-        board[i][j] = '#';//mark it as visited to avoid cycles
-        if (i > 0) {
-            dfs(root.children[c - 'a'], board, i - 1, j, result);
-        }
-        if (j > 0) {
-            dfs(root.children[c - 'a'], board, i, j - 1, result);
-        }
-        if (i + 1 < board.length) {
-            dfs(root.children[c - 'a'], board, i + 1, j, result);
-        }
-        if (j + 1 < board[0].length) {
-            dfs(root.children[c - 'a'], board, i, j + 1, result);
-        }
+            if (root.children[c - 'a'].word != null) {
+                result.add(root.children[c - 'a'].word);
+                root.children[c - 'a'].word = null;//de-duplicate
+            }
+            board[i][j] = '#';//mark it as visited to avoid cycles
+            if (i > 0) {
+                dfs(root.children[c - 'a'], board, i - 1, j, result);
+            }
+            if (j > 0) {
+                dfs(root.children[c - 'a'], board, i, j - 1, result);
+            }
+            if (i + 1 < board.length) {
+                dfs(root.children[c - 'a'], board, i + 1, j, result);
+            }
+            if (j + 1 < board[0].length) {
+                dfs(root.children[c - 'a'], board, i, j + 1, result);
+            }
 
-        board[i][j] = c;
-    }
+            board[i][j] = c;
+        }
 
-    private TrieNode root;
+        private TrieNode root;
 
-    class TrieNode {
-        String word;
-        TrieNode[] children = new TrieNode[26];
-    }
+        class TrieNode {
+            String word;
+            TrieNode[] children = new TrieNode[26];
+        }
 
-    private TrieNode buildTrie(String[] words) {
-        TrieNode root = new TrieNode();
-        for (String word : words) {
-            char[] chars = word.toCharArray();
-            TrieNode temp = root;
-            for (char c : chars) {
-                if (temp.children[c - 'a'] == null) {
-                    temp.children[c - 'a'] = new TrieNode();
+        private TrieNode buildTrie(String[] words) {
+            TrieNode root = new TrieNode();
+            for (String word : words) {
+                char[] chars = word.toCharArray();
+                TrieNode temp = root;
+                for (char c : chars) {
+                    if (temp.children[c - 'a'] == null) {
+                        temp.children[c - 'a'] = new TrieNode();
+                    }
+                    temp = temp.children[c - 'a'];
                 }
-                temp = temp.children[c - 'a'];
+                temp.word = word;
             }
-            temp.word = word;
+            return root;
         }
-        return root;
     }
-
 }
