79. Word Search
来源:互联网 发布:单页seo怎么赚钱 编辑:程序博客网 时间:2024/05/21 02:35
Given a 2D board and a word, find if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.
For example,
Given board =
[ ['A','B','C','E'], ['S','F','C','S'], ['A','D','E','E']]word =
"ABCCED"
, -> returns true
,word =
"SEE"
, -> returns true
,word =
"ABCB"
, -> returns false
.Subscribe to see which companies asked this question
样板题
跟剑指offer:矩阵中的路径一样
class Solution {public:bool exist(vector<vector<char>>& board, string word) {if (board.empty() || board[0].empty()) return false;int m = board.size(), n = board[0].size();vector<vector<bool>> visited(m, vector<bool>(n, false));for (int i = 0; i < m; i++){for (int j = 0; j < n; j++){if (dfs(board, word, visited, 0, i, j)){return true;}}}return false;}private:bool dfs(vector<vector<char>>& board, string word, vector<vector<bool>>&visited,int cur,int row,int col){if (cur == word.size()){return true;}bool found = false;if (row >= 0 && row < board.size() && col >= 0 && col < board[0].size() &&!visited[row][col] && board[row][col] == word[cur]){visited[row][col] = true;found = dfs(board, word, visited, cur + 1, row, col - 1) ||dfs(board, word, visited, cur + 1, row, col + 1) ||dfs(board, word, visited, cur + 1, row - 1, col) ||dfs(board, word, visited, cur + 1, row + 1, col);if (!found)visited[row][col] = false;}return found;}};
0 0
- LeetCode 79. Word Search
- [LeetCode]79.Word Search
- LeetCode --- 79. Word Search
- [Leetcode] 79. Word Search
- 79. Word Search
- [leetcode] 79.Word Search
- 【leetcode】79. Word Search
- 79. Word Search
- 79. Word Search
- [LeetCode]79. Word Search
- 79. Word Search LeetCode
- 79. Word Search
- 79. Word Search
- 79. Word Search
- leetcode 79. Word Search
- LeetCode 79. Word Search
- LeetCode 79. Word Search
- leetcode 79. Word Search
- python中的生产者以及消费者实现
- HTTP状态码详解
- Qt中socket编程
- windows下mysql提示access denied for user ''@'localhost' to database解决方案
- Producer指定分区
- 79. Word Search
- Qt网络应用----socket通信例子
- Linux 磁盘查询命令 du
- ACdream 1061:郭氏树
- 顺序表和链表的相关热点面试题
- hadoop、zookeeper、hbase集群安装
- PSR-3 日志接口规范
- 洛谷 P1414 又是毕业季II
- 黄阶低级 - 《 Java 核心》- 5.1 类、超类和子类(二) - 修改0次