剑指 Offer 12. 矩阵中的路径
请设计一个函数,用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径。路径可以从矩阵中的任意一格开始,每一步可以在矩阵中向左、右、上、下移动一格。如果一条路径经过了矩阵的某一格,那么该路径不能再次进入该格子。例如,在下面的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
C++版本 |
class Solution {
public:
bool exist(vector<vector<char>>& board, string word) {
int n = board.size(), m = board[0].size();
if(n == 0 || m == 0) return word.empty();
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(help(board,word,i,j,0)) return true;
}
}
return false;
}
private:
bool help(vector<vector<char>>& board,string word,int x,int y,int step){
if(x < 0 || x >= board.size() || y < 0 || y >= board[0].size() || word[step] != board[x][y])
return false;
if(step == word.size() - 1) return true;
auto tmp = board[x][y];
board[x][y] = '#';
bool res = help(board,word,x + 1,y,step + 1) || help(board,word,x - 1,y,step + 1) ||
help(board,word,x,y + 1,step + 1) || help(board,word,x,y - 1,step + 1);
board[x][y] = tmp;
return res;
}
};
Python版本 |
class Solution:
def exist(self, board: List[List[str]], word: str) -> bool:
n = len(board)
m = len(board[0]) if board else 0
def help(x,y,step):
if not 0 <= x < n or not 0 <= y < m or board[x][y] != word[step]:
return False
if step == len(word) - 1:
return True
tmp = board[x][y]
board[x][y] = '#'
res = help(x + 1,y,step + 1) or help(x - 1,y,step + 1) or help(x,y + 1,step + 1) or help(x,y - 1,step + 1)
board[x][y] = tmp
return res
for i in range(n):
for j in range(m):
if help(i,j,0):
return True
return False