leetcode-Word Search
来源:互联网 发布:博客网站源码 编辑:程序博客网 时间:2024/06/05 07:38
Word Search
Total Accepted: 11535 Total Submissions: 58659My SubmissionsGiven 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
.Discuss
典型的DFS题目。Coding过程中注意状态的变化以及边界情况。
class Solution {public: bool exist(vector<vector<char> > &board, string word) { if (word == "") { return false; } int nNumberOfRows = board.size(); vector<vector<bool> > bVisit; for (int i = 0; i < nNumberOfRows; ++i) { int nNumberOfCols = board[i].size(); bVisit.push_back(vector<bool>()); for (int j = 0; j < nNumberOfCols; ++j) { bVisit[i].push_back(false); } } for (int i = 0; i < nNumberOfRows; ++i) { int nNumberOfCols = board[i].size(); for (int j = 0; j < nNumberOfCols; ++j) { if (board[i][j] == word[0]) { if (dfs(board, i, j, bVisit, word, 1)) { return true; } } } } return false; }protected: bool dfs(vector<vector<char> > &board, int row, int col, vector<vector<bool> > &bVisit, string &word, int n) { if (n == word.size()) { return true; } bVisit[row][col] = true; static int dir[][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; for (int i = 0; i < 4; ++i) { int newRow = row + dir[i][0]; int newCol = col + dir[i][1]; if (isValid(board, bVisit, newRow, newCol) && board[newRow][newCol] == word[n]) { if (dfs(board, newRow, newCol, bVisit, word, n + 1)) { return true; } } } bVisit[row][col] = false; return false; } bool isValid(vector<vector<char> > &board, vector<vector<bool> > &bVisit, int row, int col) { if (row >= 0 && row < board.size() && col >= 0 && col < board[row].size() && !bVisit[row][col]) { return true; } 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
- 上传文件时路径总是C:\fakepath\的问题
- Android LayoutInflater原理分析,带你一步步深入了解View(一)
- Notification 和 NotificationManager的使用详解
- BUPT-SUMMER-TRAINING-搜索
- 2014 Multi-University Training Contest 1 - J Rating
- leetcode-Word Search
- 《用户体验要素》读书笔记(一)用户体验为什么这么重要
- Swift源码分析----swift-container-updater
- C++ 实现复制任意文件并显示完成百分比
- HDU 3047 Zjnu Stadium 带权并查集
- 修改UIProgressView高度
- log4j详解与实战
- hdu第一场多校第一题。(hdu 4861)
- 半监督学习