首页 > 代码库 > [leetcode-79-Word Search]
[leetcode-79-Word Search]
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.
思路：
深度优先遍历。
bool dfs(vector< vector< char> >& board, string word,int row ,int col ,int start,int m,int n,int length) { char curChar = board[row][col]; bool res = false; if(curChar != word[start]) return false; if(start == length - 1) return true; board[row][col] = ‘*‘; if(row>0) res = dfs(board,word,row-1,col,start+1,m,n,length); if(!res && row < m-1) res = dfs(board,word,row+1,col,start+1,m,n,length); if(!res && col>0) res = dfs(board,word,row,col-1,start+1,m,n,length); if(!res && col<n-1) res = dfs(board,word,row,col+1,start+1,m,n,length); board[row][col] = curChar; return res; } bool exist(vector< vector< char> >& board, string word) { int m = board.size() , n = board[0].size(), length = word.size(); if( m && n && length) { for(int i = 0;i < m;i++) { for(int j =0;j<n;j++) { if(dfs(board,word,i,j,0,m,n,length)) return true; } } } return false; }
[leetcode-79-Word Search]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。