版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/shey666/article/details/80786857
Leetcode 79
Word Search
- Problem Description:
给出一个字符矩阵和一个字符串,遍历该字符矩阵看是否能匹配该字符串。
具体的题目信息:
https://leetcode.com/problems/word-search/description/ - Example:
- Solution:
- 解题思路:用队列存储每个人的直接朋友,然后访问队列中每个人(每访问一次,队首元素出队),获取其直接朋友并入列,直至队列为空,这就形成一个朋友圈。对矩阵中的每一行重复此操作即可,注意在访问后将矩阵中对应位置值设为0防止重复访问陷入循环。
- 编程实现:
class Solution {
public:
bool exist(vector<vector<char>>& board, string word) {
if(board.size() == 0|| word.length() == 0) return false;
int pos = 0;
for (int i = 0; i < board.size(); i++) {
for (int j = 0; j < board[0].size(); j++) {
if (SS(board, i, j, word, pos))
return true;
}
}
return false;
}
bool SS(vector<vector<char>>& board, int i, int j, string word, int pos) {
if (pos == word.length()) return true;
if (i >= 0&&i < board.size()&&j >= 0&&j < board[0].size()&&board[i][j] == word[pos]) {
char t = board[i][j];
board[i][j] = '#';
if (SS(board, i+1, j, word, pos+1)||SS(board, i-1, j, word, pos+1)||SS(board, i, j+1, word, pos+1)||SS(board, i, j-1, word,pos+1)) return true;
board[i][j] = t;
}
return false;
}
};