剑指 Offer 12. 矩阵中的路径
给定一个 m x n 二维字符网格 board 和一个字符串单词 word 。如果 word 存在于网格中,返回 true ;否则,返回 false 。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
例如,在下面的 3×4 的矩阵中包含单词 “ABCCED”(单词中的字母已标出)。
示例 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
board 和 word 仅由大小写英文字母组成
解法一:dfs + 回溯
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;
}
public boolean dfs(char[][] board,char[] words,int i,int j,int k){
//结束条件
if(i >= board.length || i < 0 || j < 0 || j >= board[0].length
|| board[i][j] != words[k])
return false;
if(k == words.length -1)
return true;
board[i][j] = '\0';
//下 上 右 左
boolean res = dfs(board,words,i + 1,j,k+1) ||
dfs(board,words,i - 1,j,k+1) ||
dfs(board,words,i ,j + 1,k+1) ||
dfs(board,words,i , j - 1,k+1);
board[i][j] = words[k];
return res;
}
}
- 创建者:师晓峰
- 创建时间:2022/6/15 20:41