题目说明:
给定一个 m x n 二维字符网格 board 和一个字符串单词 word 。如果 word 存在于网格中,返回 true ;否则,返回 false 。单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
题目链接:79. 单词搜索
示例 1:
输入:board = [[“A”,“B”,“C”,“E”],[“S”,“F”,“C”,“S”],[“A”,“D”,“E”,“E”]], word = “ABCCED”
输出:true
示例 2:
输入:board = [[“A”,“B”,“C”,“E”],[“S”,“F”,“C”,“S”],[“A”,“D”,“E”,“E”]], word = “SEE”
输出:true
示例 3:
输入:board = [[“A”,“B”,“C”,“E”],[“S”,“F”,“C”,“S”],[“A”,“D”,“E”,“E”]], word = “ABCB”
输出:false
提示:
- m == board.length
- n = board[i].length
- 1 <= m, n <= 6
- 1 <= word.length <= 15
- board 和 word 仅由大小写英文字母组成
方法
class Solution:
def exist(self, board: List[List[str]], word: str) -> bool:
ans = []
m, n = len(board), len(board[0])
check = [[0] * n for _ in range(m)]
def backtrack(res, x, y, index):
if ''.join(res) == word:
ans.append(''.join(res))
return
for mx, my in [(x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)]:
if 0 <= mx < m and 0 <= my < n and check[mx][my] == 0 and board[mx][my] == word[index]:
res.append(board[mx][my])
check[mx][my] = 1
backtrack(res, mx, my, index + 1)
check[mx][my] = 0
res.pop()
for i in range(m):
for j in range(n):
if board[i][j] == word[0]:
check[i][j] = 1
backtrack([word[0]], i, j, 1)
check = [[0] * n for _ in range(m)]
for i in ans:
if i == word:
return True
return False
学无止境,还有很大的提升空间~