dfs
尤其要注意的就是要标记board有无访问过,4个方向都走过了,然后还要把board的标记改回来
最开始提交的是如下代码,参考👉 剑指offer第12题题解:图论-DFS算法 - 矩阵中的路径 - 力扣(LeetCode) (leetcode-cn.com):
class Solution {
public:
bool exist(vector<vector<char>>& board, string word) {
int rows = board.size();
int columns = board[0].size();
for(int i = 0 ; i < rows; i ++ ){
for( int j = 0 ; j < columns ; j ++ ){
if( dfs(board, word, i, j, 0))return true;
}
}
return false;
}
private:
bool dfs(vector<vector<char>> board, string word, int i, int j, int u){
if(board[i][j] != word[u])return false;
if( u == word.size()-1)return true;
char c = board[i][j];
board[i][j] = '*';
// vector<int> dx = [-1, 0, 0, 1];
// vector<int> dy = [0, -1, 1, 0];
vector<int> dx = {-1, 0, 0, 1};
vector<int> dy = {0, -1, 1, 0};
int rows = board.size();
int columns = board[0].size();
for( int k = 0 ; k < 4; k++ ){
int x = i + dx[k];
int y = j + dy[k];
if( x >=0 && x < rows && y >= 0 && y < columns){
if( dfs(board, word, x, y, u + 1))return true;
}
}
board[i][j] = c;
return false;
}
};
但是对于某些case超出了时间限制:
搜了一下,发现其他人有和我类似的问题,详细链接👉 剑指 offer 12 - 矩阵中的路径 - 力扣(LeetCode) (leetcode-cn.com)
所以对于最开始的这段代码,会把所有的可能路径都走一遍,在这所有路径中,如果有合法解,就会返回true,而如果加了剪枝,就是只要一旦找到了一个合法解,就会返回true,所以不会超时【以上都是美好想象】,实际中加了res还是会超时,参考最高赞的代码(👉面试题12. 矩阵中的路径( DFS + 剪枝 ,清晰图解) - 矩阵中的路径 - 力扣(LeetCode) (leetcode-cn.com)),魔改代码成:
class Solution {
public:
bool exist(vector<vector<char>>& board, string word) {
// bool res = false;
int rows = board.size();
int columns = board[0].size();
for(int i = 0 ; i < rows; i ++ ){
for( int j = 0 ; j < columns ; j ++ ){
if(dfs(board, word, i, j, 0)) return true;
}
}
return false;
}
private:
bool dfs(vector<vector<char>> board, string word, int i, int j, int u){
if(i < 0 || j < 0 || i >= board.size()|| j >= board[0].size() || board[i][j] != word[u])return false;
if( u == word.size()-1)return true;
char c = board[i][j];
board[i][j] = '*';
if( dfs(board, word, i, j + 1, u + 1) || dfs(board, word, i, j - 1, u + 1) || dfs(board, word, i - 1, j, u + 1) || dfs(board, word, i + 1, j, u + 1))return true;
board[i][j] = c;
return false;
}
};
还是会超时,对比了下这份代码和最高赞的代码,感觉没有啥区别啊😭,为啥我的就一直超出时间限制,我一行行的把高赞的代码替换到我的code segment里面,终于发现了😭😭😭😭(忍不住了),是在dfs函数的参数里面,我最开始传入的是board,而高赞答案传入的是 引用&,这是唯一的区别,改成引用之后就通过了
class Solution {
public:
bool exist(vector<vector<char>>& board, string word) {
rows = board.size();
columns = board[0].size();
for(int i = 0 ; i < rows; i ++ ){
for( int j = 0 ; j < columns ; j ++ ){
if(dfs(board, word, i, j, 0)) return true;
}
}
return false;
}
private:
int rows, columns;
bool dfs(vector<vector<char>>& board, string word, int i, int j, int u){
if(i >= board.size()|| j >= board[0].size() ||i < 0 || j < 0 || board[i][j] != word[u])return false;
if( u == word.size()-1)return true;
board[i][j] = '\0';
bool res = dfs(board, word, i, j + 1, u + 1) || dfs(board, word, i, j - 1, u + 1) || dfs(board, word, i - 1, j, u + 1) || dfs(board, word, i + 1, j, u + 1);
board[i][j] = word[u];
return res;
}
};
把最初的代码改成引用也通过了:
class Solution {
public:
bool exist(vector<vector<char>>& board, string word) {
int rows = board.size();
int columns = board[0].size();
for(int i = 0 ; i < rows; i ++ ){
for( int j = 0 ; j < columns ; j ++ ){
if( dfs(board, word, i, j, 0))return true;
}
}
return false;
}
private:
bool dfs(vector<vector<char>>& board, string word, int i, int j, int u){
if(board[i][j] != word[u])return false;
if( u == word.size()-1)return true;
char c = board[i][j];
board[i][j] = '*';
// vector<int> dx = [-1, 0, 0, 1];
// vector<int> dy = [0, -1, 1, 0];
vector<int> dx = {-1, 0, 0, 1};
vector<int> dy = {0, -1, 1, 0};
int rows = board.size();
int columns = board[0].size();
for( int k = 0 ; k < 4; k++ ){
int x = i + dx[k];
int y = j + dy[k];
if( x >=0 && x < rows && y >= 0 && y < columns){
if( dfs(board, word, x, y, u + 1))return true;
}
}
board[i][j] = c;
return false;
}
};
问了下yangshen,dalao说是的:
这告诫我们,只要没通过,就一定存在问题,找到他,才是提高,才是improve。不要自大