LeetCode | Word Search
来源:互联网 发布:利润率的算法 编辑:程序博客网 时间:2024/05/23 12:14
题目:
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
.思路:
‘一个常规的NP问题,直接上代码。
代码:
class Solution {public: bool exist(vector<vector<char> > &board, string word) { for(int i=0;i<board.size();i++) { for(int j =0;j<board[i].size();j++) { if(existWord(board,word,i,j,0)) { return true; } } } return false; } bool existWord(vector<vector<char>> &board, string word, int i, int j, int n) { if(i >= board.size() || i<0) { return false; } else if(j >= board[0].size() || j < 0) { return false; } else { if(board[i][j] == word[n]) { if(n==word.size()-1) { return true; } board[i][j] = '.'; if(existWord(board,word,i-1,j,n+1)) { return true; } else if(existWord(board,word,i,j-1,n+1)) { return true; } else if(existWord(board,word,i+1,j,n+1)) { return true; } else if(existWord(board,word,i,j+1,n+1)) { return true; } board[i][j] = word[n]; return false; } return false; } }};
0 0
- 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
- 凤凰涅槃:从 iBatis 到 MyBatis
- shell脚本操作mysql数据库
- vim插件配置(windows)
- glDrawArrays,glDrawElements用法
- Maven基础
- LeetCode | Word Search
- wget 下载jdk
- 获取前几条数据 和后几条数据
- 关于OpenGL ES中灯光与材质的疑惑
- iOS中XML解析libxml2(实例:打印xml内容及存储到数组)
- bolt界面引擎学习笔记一
- int main(int argc, char* argv[])用法详解
- gp日常维护
- 学生信息