剑指 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
仅由大小写英文字母组成
**注意:**本题与主站 79 题相同:https://leetcode-cn.com/problems/word-search/
解答:
class Solution {
//DFS+剪枝
//时间复杂度O(MN),空间复杂度O(MN)
boolean flag = false;
public boolean exist(char[][] board, String word) {
char[] array = word.toCharArray();
for(int i = 0; i < board.length; i++){
for(int j = 0; j < board[0].length; j++){
if(DFS(board, i, j, array, 0)) return true;
}
}
return false;
}
public boolean DFS(char[][] board, int i, int j, char[] array, int index){
if(i >= board.length || i < 0 || j >= board[0].length || j < 0 || board[i][j] != array[index]) return false;
if(index == array.length - 1) return true;
board[i][j] = '\0';
boolean res = DFS(board, i + 1, j, array, index + 1) ||
DFS(board, i - 1, j, array, index + 1) ||
DFS(board, i, j + 1, array, index + 1) ||
DFS(board, i, j - 1, array, index + 1);
board[i][j] = array[index];
return res;
}
}
参考自:
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof/solution/mian-shi-ti-12-ju-zhen-zhong-de-lu-jing-shen-du-yo/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。