class Solution {
private:
int row, col;
public:
bool exist(vector<vector<char>>& board, string word) {
row = board.size();
col = board[0].size();
for (int i = 0; i < board.size(); ++i)
for (int j = 0; j < board[0].size(); ++j)
if (dfs(board, word, i, j, 0))
return true;
return false;
}
bool dfs(vector<vector<char>>& board, const string& word, int i, int j, int k) {
if (i < 0 || i >= row || j < 0 || j >= col || board[i][j] != word[k])
return false;
if (k == word.size() - 1)
return true;
board[i][j] = '\0';
bool flag = dfs(board, word, i - 1, j, k + 1) || dfs(board, word, i + 1, j, k + 1) ||
dfs(board, word, i, j - 1, k + 1) || dfs(board, word, i, j + 1, k + 1);
board[i][j] = word[k];
return flag;
}
};
剑指 Offer 12. 矩阵中的路径
最新推荐文章于 2024-10-18 23:40:34 发布
该博客介绍了如何使用深度优先搜索(DFS)算法在二维字符矩阵中查找给定单词是否存在一条从左上角到右下角的路径。代码实现中,通过遍历矩阵并递归地检查相邻单元格来寻找路径,最后回溯矩阵状态以保持原始数据不变。
摘要由CSDN通过智能技术生成