给定一个 m x n 二维字符网格 board 和一个字符串单词 word 。如果 word 存在于网格中,返回 true ;否则,返回 false 。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
例如,在下面的 3×4 的矩阵中包含单词 “ABCCED”(单词中的字母已标出)。
示例 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
board 和 word 仅由大小写英文字母组成
解答:回溯法+dfs
#include<iostream>
using namespace std;
#include<vector>
bool dfs(vector<vector<char>>& board, string word, int i, int j, int id, vector<vector<bool>>& visited);
bool exist(vector<vector<char>>& board, string word) {
int row = board.size();
int col = board[0].size();
if (row == 0 && col == 0) return false;
if (word.size() == 0) return false;
vector<vector<bool>>visited(row, vector<bool>(col, false));
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
if (dfs(board, word, i, j, 0, visited)) return true;
}
}
return false;
}
bool dfs(vector<vector<char>>& board, string word, int i, int j, int id, vector<vector<bool>>& visited) {
if (i<0 || i>=board.size() || j<0 || j>=board[0].size() || visited[i][j] == true) return false;
if (board[i][j] != word[id]) return false;
if (id == word.size() - 1) return true;
visited[i][j] = true;
bool flag = dfs(board, word, i - 1, j, id + 1, visited) || dfs(board, word, i + 1, j, id + 1, visited) || dfs(board, word, i, j + 1, id + 1, visited) || dfs(board, word, i, j - 1, id + 1, visited);
if (!flag) {
visited[i][j] = false;
}
return flag;
}
void test01() {
vector<vector<char>>board(2,vector<char>(2));
board[0][0] = 'a';
board[0][1] = 'b';
board[1][0] = 'c';
board[1][1] = 'd';
string word = "abdc";
if (exist(board, word)) {
cout << "存在" << endl;
}
else {
cout << "不存在" << endl;
}
}
int main() {
test01();
system("pause");
return 0;
}