给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D','E','E']
]
给定 word = "ABCCED", 返回 true.
给定 word = "SEE", 返回 true.
给定 word = "ABCB", 返回 false.
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/word-search
思路:深度优先搜索
(1)当前位置超出边界、当前位置值已搜索、当前位置值不等于第 i 个字符值,返回False;
(2)当前位置值等于第 i 个字符值且 i 为总字符串长度时,返回True;
(3)当前位置值等于第 i 个字符值时,递归查找其四邻域是否等于第 i+1个值。
class Solution:
def exist(self, board: [[str]], word: str) -> bool:
if(not board):return False
h,w=len(board),len(board[0])
cur=[]
for i in range(h):
for j in range(w):
if(board[i][j] == word[0]):
if (self.dfs(i,j,0,word,board,cur)):return True
return False
def dfs(self,i,j,k,word,board,hel):
if( i<0 or j<0 or i>=len(board) or j>=len(board[0]) or board[i][j]!=word[k] or (i,j) in hel):
return False
if(k==len(word)-1 and board[i][j]==word[k]):return True
return self.dfs(i+1,j,k+1,word,board,hel+[(i,j)]) or self.dfs(i,j+1,k+1,word,board,hel+[(i,j)]) or self.dfs(i-1,j,k+1,word,board,hel+[(i,j)]) or self.dfs(i,j-1,k+1,word,board,hel+[(i,j)])
if __name__=="__main__":
print(Solution().exist([["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]],"ABCCED"))