题目:
请设计一个函数,用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径。路径可以从矩阵中的任意一格开始,每一步可以在矩阵中向左、右、上、下移动一格。如果一条路径经过了矩阵的某一格,那么该路径不能再次进入该格子。例如,在下面的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
提示:
1 <= board.length <= 200
1 <= board[i].length <= 200
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof
思路:本题可以利用深度遍历 + 回溯法来解决
Java代码如下:
class Solution {
public boolean exist(char[][] board, String word) {
for(int i=0;i<board.length;i++){
for (int j=0;j<board[0].length;j++){
if(dfs(board,word,0,i,j)){
return true;
}
}
}
return false;
}
public boolean dfs(char[][] board, String word, int index, int i, int j) {
if (i >= 0 && i < board.length && j >= 0 && j < board[0].length
&& index == word.length() - 1 && word.charAt(index) == board[i][j]) {
return true;
}
if (i < 0 || i > board.length - 1 || j < 0 || j > board[0].length - 1
|| index < word.length() && word.charAt(index) != board[i][j] || index > word.length()) {
return false;
}
char tmp = board[i][j];
board[i][j] = '0';
boolean result = dfs(board, word, index + 1, i + 1, j) || dfs(board, word, index+1, i , j + 1)
|| dfs(board, word, index + 1, i - 1, j) || dfs(board, word, index + 1, i, j - 1);
//board[i][j] = word.charAt(index);
board[i][j] = tmp;
return result;
}
}