Given a 2D board and a word, find if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.
For example, Given board =
[ [‘A’,’B’,’C’,’E’], [‘S’,’F’,’C’,’S’], [‘A’,’D’,’E’,’E’] ] word = “ABCCED”, -> returns true, word = “SEE”, -> returns true, word = “ABCB”, -> returns false.
publicclassSolution{ publicbooleanexist(char[][] board, String word){ if (word == null || word.length() == 0 || board[0].length == 0) { returnfalse; } // can use bit XOR with the original board to save space boolean[][] used = newboolean[board.length][board[0].length]; for (int i = 0; i < board.length; i++) { for (int j = 0; j < board[0].length; j++) { if (exist(board, word, 0, i, j, used)) { returntrue; } } } returnfalse; } publicbooleanexist(char[][] board, String word, int index, int x, int y, boolean[][] used){ if (index == word.length()) { returntrue; } elseif (x < 0 || y < 0 || x == board.length || y == board[0].length) { returnfalse; } else { if (used[x][y] == false && board[x][y] == word.charAt(index)) { used[x][y] = true; boolean exist = exist(board, word, index + 1, x + 1, y, used) || exist(board, word, index + 1, x - 1, y, used) || exist(board, word, index + 1, x , y + 1, used) || exist(board, word, index + 1, x, y - 1, used); used[x][y] = false; return exist; } else { returnfalse; } } } }