目录
1.题目
给定一个 m x n 二维字符网格 board 和一个字符串单词 word 。如果 word 存在于网格中,返回 true ;否则,返回 false 。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例 1:
输入:board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
输出:true
示例 2:
输入:board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"
输出:true
示例 3:
输入:board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"
输出:false
提示:
m == board.length
n = board[i].length
1 <= m, n <= 6
1 <= word.length <= 15
board 和 word 仅由大小写英文字母组成
进阶:你可以使用搜索剪枝的技术来优化解决方案,使其在 board 更大的情况下可以更快解决问题?
来源:力扣(LeetCode)
2.代码
思路不难直接上代码:
class Solution {
public:
int x_max, y_max, n;
//递归搜索
bool func(vector<vector<char>>& board, int x, int y, int step, string& word, vector<vector<int>>& index) {
if (n == step) return true;
if (x < 0 || y < 0 || x >= x_max || y >= y_max || index[x][y] == 0) {
return false;
} else {
if (word[step] == board[x][y]) {
index[x][y] = 0;
if (func(board, x + 1, y, step+1, word, index) || func(board, x, y + 1, step+1, word, index) || func(board, x - 1, y, step+1, word, index) || func(board, x, y - 1, step+1, word, index)) {
return true;
}
index[x][y] = 1;
}
return false;
}
}
bool exist(vector<vector<char>>& board, string word) {
x_max = board.size();
y_max = board[0].size();
n = word.size();
//对每个节点进行搜索
for (int i = 0; i < x_max; ++i) {
for (int k = 0; k < y_max; ++k) {
if (board[i][k] == word[0]) {
vector<vector<int>>index(x_max, vector<int>(y_max, 1));
index[i][k] = 0;
if (func(board, i + 1, k, 1, word, index) || func(board, i, k + 1, 1, word, index) || func(board, i - 1, k, 1, word, index) || func(board, i, k - 1, 1, word, index)) {
return true;
}
}
}
}
return false;
}
};
3.经验
几乎同样的代码,如果不使用&进行引用传参就会超时。搜索相关问题,得出的结论是:不使用&,传进函数的就不是参数本身,而是它的拷贝,这就需要消耗额外的时间与空间,所以尽量引用传参。