class Solution {
public boolean exist(char[][] board, String word) {
char[] words = word.toCharArray();
for(int i = 0; i < board.length; i++){
for(int j = 0; j < board[0].length; j++){
if(dfs(board, words, i, j, 0)){
return true;
}
}
}
return false;
}
boolean dfs(char[][] board, char[] word, int i, int j, int k){
//行或列索引越界/当前矩阵元素与目标字符不同/当前矩阵元素已访问过...
if(i >= board.length || i < 0 || j >= board[0].length || j < 0 || board[i][j] != word[k])
return false;
if(k == word.length - 1)
return true;
board[i][j] = '\0';//将board[i][j]修改为空字符,代表此元素已经被访问过,防止之后搜索时重复访问
//DFS顺序为"下 上 右 左"
boolean res = dfs(board, word, i + 1, j, k + 1) || dfs(board, word, i - 1, j, k + 1)
|| dfs(board, word, i, j + 1, k + 1) || dfs(board, word, i, j - 1, k + 1);
board[i][j] = word[k];
return res;
}
}
该题是典型的矩阵搜索问题,使用深度优先搜素(DFS) + 剪枝解决
深度优先搜索:
(暴力法遍历矩阵中所有字符串可能性)
DFS通过递归,先朝一个方向搜索到底,再回溯至上个节点,沿另一个方向搜索,以此类推剪枝:
在搜索中,遇到 这条路不可能和目标字符串匹配成功 的情况(例如: 此矩阵元素和目标字符不同/此元素已被访问),则应立即返回,称之为 可行性剪枝
解题思路:
将索引 (i, j)
存入visited
中,代表此元素已被访问过
终止条件:
- 行或列索引越界
- 数位和超出目标值
k
- 当前元素已访问过
class Solution {
public int movingCount(int m, int n, int k) {
boolean[][] visited = new boolean[m][n];
return dfs(visited, m, n, k, 0, 0);
}
public int dfs(boolean[][] visited, int m, int n, int k, int i, int j){
if(i >= m || j >=n || visited[i][j] || bitSum(i) + bitSum(j) > k){
return 0;
}
visited[i][j] = true;
return 1 + dfs(visited, m, n, k, i + 1, j) + dfs(visited, m, n, k, i, j +1);
}
public int bitSum(int n){
int sum = 0;
while(n > 0){
sum += n % 10;
n /= 10;
}
return sum;
}
}