fix build

fishercoder1534 · fishercoder1534 · commit fd46b035c013 · 2021-01-25T14:50:52.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_79.java b/src/main/java/com/fishercoder/solutions/_79.java
@@ -51,31 +51,36 @@ public boolean exist(char[][] board, String word) {
 
             for (int i = 0; i < row; i++) {
                 for (int j = 0; j < col; j++) {
-                    if (board[i][j] == word.charAt(0) && search(board, i, j, word, 0) == true)
+                    if (board[i][j] == word.charAt(0) && search(board, i, j, word, 0) == true) {
                         return true;
+                    }
                 }
             }
             return false;
         }
 
         private boolean search(char[][] board, int i, int j, String word, int index) {
-            if (index == word.length() - 1)
+            if (index == word.length() - 1) {
                 return true;
+            }
 
             // store the visited char in temp variable
             char temp = board[i][j];
             board[i][j] = ' ';
-            if (i > 0 && board[i - 1][j] == word.charAt(index + 1) && search(board, i - 1, j, word, index + 1) == true)
+            if (i > 0 && board[i - 1][j] == word.charAt(index + 1) && search(board, i - 1, j, word, index + 1) == true) {
                 return true;
-            if (i < board.length - 1 && board[i + 1][j] == word.charAt(index + 1) && search(board, i + 1, j, word, index + 1) == true)
+            }
+            if (i < board.length - 1 && board[i + 1][j] == word.charAt(index + 1) && search(board, i + 1, j, word, index + 1) == true) {
                 return true;
+            }
 
-            if (j > 0 && board[i][j - 1] == word.charAt(index + 1) && search(board, i, j - 1, word, index + 1) == true)
+            if (j > 0 && board[i][j - 1] == word.charAt(index + 1) && search(board, i, j - 1, word, index + 1) == true) {
                 return true;
+            }
 
-
-            if (j < board[0].length - 1 && board[i][j + 1] == word.charAt(index + 1) && search(board, i, j + 1, word, index + 1) == true)
+            if (j < board[0].length - 1 && board[i][j + 1] == word.charAt(index + 1) && search(board, i, j + 1, word, index + 1) == true) {
                 return true;
+            }
 
             board[i][j] = temp;
             return false;
