0.前景回顾
代码内容如下:
private boolean dfs(char[][] board, int[][] k, String word, int index, int i, int j) {
if (index >= word.length()) {
return true;
}
if (i >= board.length || i < 0 || j < 0 || j >= board[0].length) {
return false;
}
// 已使用
if (k[i][j] == 1 || board[i][j] != word.charAt(index)) {
return false;
}
// 问题行
k[i][j] = 1;
return dfs(board, k<