LeetCode79题，不知道哪里有错误

Z时代
2024-01-10
分类：技术分享

题目是：

79. 单词搜索

给定一个二维网格和一个单词，找出该单词是否存在于网格中。

单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。

示例:

board =

[

['A','B','C','E'],

['S','F','C','S'],

['A','D','E','E']

]

给定 word = "ABCCED", 返回 true

给定 word = "SEE", 返回 true

给定 word = "ABCB", 返回 false

我的代码是：

class Solution:

    def exist(self, board: List[List[str]], word: str) -> bool:
def dfs(point,rWord):
if rWord=='':
return True
else:
temp = rWord[0]
if point[0]-1 >= 0 and board[point[1]][point[0]-1] == temp:
rWord = rWord[1:]
point=[point[0]-1,point[1]]
dfs(point,rWord)
elif point[0]+1 <len(board[0]) and board[point[1]][point[0]+1] == temp:
rWord = rWord[1:]
point = [point[0]+1,point[1]]
dfs(point,rWord)
elif point[1]-1>=0 and board[point[1]-1][point[0]] == temp:
rWord = rWord[1:]
point = [point[0],point[1]-1]
dfs(point,rWord)
elif point[1]+1<len(board) and board[point[1]+1][point[0]] == temp:
rWord = rWord[1:]
point = [point[0],point[1]+1]
dfs(point,rWord)
else:
return
for i in range(len(board)):
for j in range(len(board[0])):
if board[i][j] == word[0]:
dfs([j,i],word[1:])
return False