描述:
请设计一个函数,用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径。路径可以从矩阵中的任意一格开始,每一步可以在矩阵中向左、右、上、下移动一格。如果一条路径经过了矩阵的某一格,那么该路径不能再次进入该格子。例如,在下面的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)
代码:
class Solution {
public boolean exist(char[][] board, String word) {
//将字符串string 转化为charleixing
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;
}
private boolean dfs(char[][] board,char[] words,int a,int b,int c){
if(a<0||b<0||a>=board.length||b>=board[0].length||words[c]!=board[a][b]){
return false;
}
if(c==words.length-1){
return true;
}
//下边是关键的算法
char tem=board[a][b];
board[a][b]='/';
boolean res=dfs(board,words,a+1,b,c+1)||dfs(board,words,a-1,b,c+1)||dfs(board,words,a,b+1,c+1)||dfs(board,words,a,b-1,c+1);
board[a][b]=tem;
return res;
}
}
性能: