leetcode链接:https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof/
请设计一个函数,用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径。路径可以从矩阵中的任意一格开始,每一步可以在矩阵中向左、右、上、下移动一格。如果一条路径经过了矩阵的某一格,那么该路径不能再次进入该格子。例如,在下面的3×4的矩阵中包含一条字符串“bfce”的路径(路径中的字母用加粗标出)。
[["a","b","c","e"],
["s","f","c","s"],
["a","d","e","e"]]
但矩阵中不包含字符串“abfb”的路径,因为字符串的第一个字符b占据了矩阵中的第一行第二个格子之后,路径不能再次进入这个格子。
示例 1:
输入:board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
输出:true示例 2:
输入:board = [["a","b"],["c","d"]], word = "abcd"
输出:false
解题思路: 可以使用dfs来搜索,判断是否有满足条件的路径,因为可以从矩阵中任一点开始搜索,所以遍历所有点作为起点搜索。在遍历到某一点时,将该点设置为‘/’,在回溯到该点后恢复为原来的元素。知道遍历结束或者找到路径。
class Solution {
public boolean exist(char[][] board, String word) {
char[] path = word.toCharArray();
for(int i=0;i<board.length;i++){
for(int j=0;j<board[0].length;j++){
if(dfs(board,i,j,path,0)){
return true;
}
}
}
return false;
}
public boolean dfs(char[][] board,int i,int j,char[] path,int k){
if(i<0 || i>=board.length || j<0 || j>=board[0].length || path[k] != board[i][j]){
return false;
}
if(k==path.length-1){
return true;
}
char tmp = board[i][j];
board[i][j] = '/';
boolean result = dfs(board,i-1,j,path,k+1) || dfs(board,i+1,j,path,k+1)
|| dfs(board,i,j-1,path,k+1) || dfs(board,i,j+1,path,k+1);
board[i][j] = tmp;
return result;
}
}