标签：style blog http color io os ar java for
Word Search
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 =
[
["ABCE"],
["SFCS"],
["ADEE"]
]
word = "ABCCED", -> returns true,
word = "SEE", -> returns true,
word = "ABCB", -> returns false.
Solution1:
这个题目基本上就是DFS喽。然后注意一下递归回溯的问题。我们可以建设一个boolean的数组来记录访问过的值。在return false之前，我们应该把之前置
过的标记位置回来. 时间复杂度： http://www1.mitbbs.ca/article_t1/JobHunting/32524193_32524299_2.html
time 复杂度是m*n*4^(k-1). 也就是m*n*4^k.
m X n is board size, k is word size.
recuision最深是k层，recursive部分空间复杂度应该是O(k) + O(m*n)(visit array)
1 package Algorithms.dfs; 2 3 public class Exist { 4 public boolean exist(char[][] board, String word) { 5 if (board == null || word == null 6 || board.length == 0 || board[0].length == 0) { 7 return false; 8 } 9 10 int rows = board.length; 11 int cols = board[0].length; 12 13 boolean[][] visit = new boolean[rows][cols]; 14 15 // i means the index. 16 for (int i = 0; i < rows; i++) { 17 for (int j = 0; j < cols; j++) { 18 // dfs all the characters in the matrix 19 if (dfs(board, i, j, word, 0, visit)) { 20 return true; 21 } 22 } 23 } 24 25 return false; 26 } 27 28 public boolean dfs(char[][] board, int i, int j, String word, int wordIndex, boolean[][] visit) { 29 int rows = board.length; 30 int cols = board[0].length; 31 32 int len = word.length(); 33 if (wordIndex >= len) { 34 return true; 35 } 36 37 // the index is out of bound. 38 if (i < 0 || i >= rows || j < 0 || j >= cols) { 39 return false; 40 } 41 42 // the character is wrong. 43 if (word.charAt(wordIndex) != board[i][j]) { 44 return false; 45 } 46 47 // 不要访问访问过的节点 48 if (visit[i][j] == true) { 49 return false; 50 } 51 52 visit[i][j] = true; 53 54 // 递归 55 // move down 56 if (dfs(board, i + 1, j, word, wordIndex + 1, visit)) { 57 return true; 58 } 59 60 // move up 61 if (dfs(board, i - 1, j, word, wordIndex + 1, visit)) { 62 return true; 63 } 64 65 // move right 66 if (dfs(board, i, j + 1, word, wordIndex + 1, visit)) { 67 return true; 68 } 69 70 // move left 71 if (dfs(board, i, j - 1, word, wordIndex + 1, visit)) { 72 return true; 73 } 74 75 // 回溯 76 visit[i][j] = false; 77 return false; 78 } 79 }
Solution2:
与解1是一样的，但我们可以省掉O(m*n)的空间复杂度。具体的作法是：在进入DFS后，把访问过的节点置为‘#‘，访问完毕之后再置回来即可。
1 /* 2 * Solution 2: 可以省掉一个visit的数组 3 * */ 4 public boolean exist(char[][] board, String word) { 5 if (board == null || word == null 6 || board.length == 0 || board[0].length == 0) { 7 return false; 8 } 9 10 int rows = board.length; 11 int cols = board[0].length; 12 13 // i means the index. 14 for (int i = 0; i < rows; i++) { 15 for (int j = 0; j < cols; j++) { 16 // dfs all the characters in the matrix 17 if (dfs(board, i, j, word, 0)) { 18 return true; 19 } 20 } 21 } 22 23 return false; 24 } 25 26 public boolean dfs(char[][] board, int i, int j, String word, int wordIndex) { 27 int rows = board.length; 28 int cols = board[0].length; 29 30 int len = word.length(); 31 if (wordIndex >= len) { 32 return true; 33 } 34 35 // the index is out of bound. 36 if (i < 0 || i >= rows || j < 0 || j >= cols) { 37 return false; 38 } 39 40 // the character is wrong. 41 if (word.charAt(wordIndex) != board[i][j]) { 42 return false; 43 } 44 45 // mark it to be ‘#‘, so we will not revisit this. 46 board[i][j] = ‘#‘; 47 48 // 递归 49 // move down 50 if (dfs(board, i + 1, j, word, wordIndex + 1)) { 51 return true; 52 } 53 54 // move up 55 if (dfs(board, i - 1, j, word, wordIndex + 1)) { 56 return true; 57 } 58 59 // move right 60 if (dfs(board, i, j + 1, word, wordIndex + 1)) { 61 return true; 62 } 63 64 // move left 65 if (dfs(board, i, j - 1, word, wordIndex + 1)) { 66 return true; 67 } 68 69 // 回溯 70 board[i][j] = word.charAt(wordIndex); 71 return false; 72 }
GitHub代码:
标签：style blog http color io os ar java for
原文地址：http://www.cnblogs.com/yuzhangcmu/p/4040418.html
