题目概述
解题思路
我采用的思路是深度优先搜索。复杂度是O(MN * len(S))。
方法性能
蜗牛速度:
接下来开始优化,我的优化思路主要有:
- 去除设置的二维矩阵,用原始矩阵“存储”当前遍历的状态。思路就是把当前遍历到的那个位置的值,置为某个不属于矩阵出现的字符范畴的值(比如“#”),等到遍历完从该节点出发的所有矩阵以后,再将它置为原值;
- 减少计算矩阵的形状、字符串长度所花的时间,我们把这些值作为参数直接传入函数
- 减少递归函数部分的复杂度。
看下加速结果:
示例代码
蜗牛速度:
class Solution {
public:
int dir[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
bool dfs(vector<vector<char>>& board, string word, int cur_len, vector<int> cur_cor, bool **vis)
{
if(word.size() == cur_len)
return true;
bool res = false;
for(int di = 0; di < 4; ++di)
{
int xi = cur_cor[0] + dir[di][0],
yi = cur_cor[1] + dir[di][1];
if(xi < 0 || xi >= board.size() || yi < 0 || yi >= board[0].size())
continue;
if(board[xi][yi] == word[cur_len] && vis[xi][yi] == false)
{
vis[xi][yi] = true;
if(dfs(board, word, cur_len + 1, vector<int> {xi, yi}, vis))
return true;
vis[xi][yi] = false;
}
}
return false;
}
bool exist(vector<vector<char>>& board, string word)
{
int R_len = board.size(), C_len = board[0].size();
vector<vector<int>> sta_node;
bool **vis = new bool *[R_len];
for(int i = 0; i < R_len; ++i)
{
vis[i] = new bool[C_len];
for(int j = 0; j < C_len; ++j)
vis[i][j] = false;
}
for(int ri = 0; ri < R_len; ++ri)
{
for(int ci = 0; ci < C_len; ++ci)
{
if(board[ri][ci] == word[0])
{
vis[ri][ci] = true;
if(dfs(board, word, 1, vector<int>{ri, ci}, vis))
return true;
vis[ri][ci] = false;
}
}
}
return false;
}
};
加速版本:
class Solution {
public:
bool dfs(vector<vector<char>>& board, string word, int cur_len, int Xi, int Yi, int R_len, int C_len)
{
if(Xi < 0 || Yi < 0 || Xi == R_len || Yi == C_len)
return false;
if(word[cur_len] != board[Xi][Yi])
return false;
if(0 == cur_len)
return true;
char temp = board[Xi][Yi];
board[Xi][Yi] = '@';
if(dfs(board, word, cur_len - 1, Xi, Yi + 1, R_len, C_len))
return true;
if(dfs(board, word, cur_len - 1, Xi + 1, Yi, R_len, C_len))
return true;
if(dfs(board, word, cur_len - 1, Xi, Yi - 1, R_len, C_len))
return true;
if(dfs(board, word, cur_len - 1, Xi - 1, Yi, R_len, C_len))
return true;
board[Xi][Yi] = temp;
return false;
}
bool exist(vector<vector<char>>& board, string word)
{
int R_len = board.size(),
C_len = board[0].size(),
W_len = word.size();
for(int ri = 0; ri < R_len; ++ri)
{
for(int ci = 0; ci < C_len; ++ci)
{
if(dfs(board, word, W_len - 1, ri, ci, R_len, C_len))
return true;
}
}
return false;
}
};