refactor 79

fishercoder1534 · fishercoder1534 · commit 204e107da8e4 · 2020-07-21T06:18:53.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_79.java b/src/main/java/com/fishercoder/solutions/_79.java
@@ -3,50 +3,6 @@
 public class _79 {
 
     public static class Solution1 {
-
-        public boolean exist(char[][] board, String word) {
-            int m = board.length;
-            int n = board[0].length;
-            boolean[][] visited = new boolean[m][n];
-            for (int i = 0; i < m; i++) {
-                for (int j = 0; j < n; j++) {
-                    if (dfs(board, visited, i, j, word, 0)) {
-                        return true;
-                    }
-                }
-            }
-            return false;
-        }
-
-        final int[] dirs = new int[]{0, 1, 0, -1, 0};
-
-        boolean dfs(char[][] board, boolean[][] visited, int row, int col, String word, int index) {
-            if (index >= word.length() || word.charAt(index) != board[row][col]) {
-                return false;
-            } else if (index == word.length() - 1 && word.charAt(index) == board[row][col]) {
-                visited[row][col] = true;
-                return true;
-            }
-            visited[row][col] = true;//set it to true for this case
-            boolean result = false;
-            for (int i = 0; i < 4; i++) {
-                int nextRow = row + dirs[i];
-                int nextCol = col + dirs[i + 1];
-                if (nextRow < 0 || nextRow >= board.length || nextCol < 0 || nextCol >= board[0].length || visited[nextRow][nextCol]) {
-                    continue;
-                }
-                result = dfs(board, visited, nextRow, nextCol, word, index + 1);
-                if (result) {
-                    return result;
-                } else {
-                    visited[nextRow][nextCol] = false;//set it back to false if this road doesn't work to allow it for other paths, this is backtracking!!!
-                }
-            }
-            return result;
-        }
-    }
-
-    public static class Solution2 {
         //credit: https://discuss.leetcode.com/topic/21142/my-java-solution
 
         boolean[][] visited;
diff --git a/src/test/java/com/fishercoder/_79Test.java b/src/test/java/com/fishercoder/_79Test.java
@@ -8,13 +8,11 @@
 
 public class _79Test {
     private static _79.Solution1 solution1;
-    private static _79.Solution2 solution2;
     private static char[][] board;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _79.Solution1();
-        solution2 = new _79.Solution2();
     }
 
     @Test
@@ -25,7 +23,6 @@ public void test1() {
                 {'A', 'D', 'E', 'E'},
         };
         assertEquals(true, solution1.exist(board, "ABCEFSADEESE"));
-        assertEquals(true, solution2.exist(board, "ABCEFSADEESE"));
     }
 
     @Test
@@ -36,13 +33,10 @@ public void test2() {
                 {'A', 'D', 'E', 'E'},
         };
         assertEquals(true, solution1.exist(board, "ABCCED"));
-        assertEquals(true, solution2.exist(board, "ABCCED"));
 
         assertEquals(true, solution1.exist(board, "SEE"));
-        assertEquals(true, solution2.exist(board, "SEE"));
 
         assertEquals(false, solution1.exist(board, "ABCD"));
-        assertEquals(false, solution2.exist(board, "ABCD"));
     }
 
     @Test
@@ -52,7 +46,6 @@ public void test3() {
                 {'a'},
         };
         assertEquals(false, solution1.exist(board, "aaa"));
-        assertEquals(false, solution2.exist(board, "aaa"));
     }
 
 }
