[leetcode]word search
来源:互联网 发布:阿里云视频 保利威视 编辑:程序博客网 时间:2024/04/18 20:06
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 =
[ ["ABCE"], ["SFCS"], ["ADEE"]]word =
"ABCCED"
, -> returns true
,word =
"SEE"
, -> returns true
,word =
"ABCB"
, -> returns false
.Array Backtracking
class Solution {public: bool dfs(vector<vector<char> > &board, string word, int i, int j){ int M = board.size(); int N = board[0].size(); if(i < 0 || j < 0 || i >= M || j >= N || board[i][j]!=word[0]) return false; if(word.size() == 1) return true; board[i][j] = '#'; bool tmp = dfs(board, word.substr(1,word.size()-1), i-1, j) || dfs(board, word.substr(1,word.size()-1), i+1, j) || dfs(board, word.substr(1,word.size()-1), i, j-1) || dfs(board, word.substr(1,word.size()-1), i, j+1); board[i][j] = word[0]; return tmp; } bool exist(vector<vector<char> > &board, string word) { // Start typing your C/C++ solution below // DO NOT write int main() function if(board.empty()) return false; for(int i = 0; i < board.size(); i++){ for(int j = 0; j < board[0].size(); j++){ if(dfs(board, word, i, j)) return true; } } return false; }};
- LeetCode: Word Search
- [Leetcode] Word Search
- LeetCode : Word Search
- Leetcode: Word Search
- [LeetCode] Word Search
- leetcode 56: Word Search
- Leetcode 79 Word Search
- [leetcode ] word search
- [Leetcode] Word Search
- [LeetCode]Word Search
- Leetcode Word Search
- [leetcode]word search
- [leetcode] Word Search
- LeetCode-Word Search
- [LeetCode] Word Search
- LeetCode - Word Search
- leetcode word search
- LeetCode:Word Search
- android touch事件处理
- Extjs的学习
- html标签
- 提高你的Java代码质量吧
- Android Touch事件
- [leetcode]word search
- struts2配置文件详解 .
- 公式记录
- linux常用命令
- 韦东山视频 笔记
- DNF盗号木马之突破令牌密保
- POJ 2856 Y2K Accounting Bug【简单暴力】
- STM32 USB Mass Storage 例程调试笔记
- Free AppleScript Code Examples