剑指 Offer 12. 矩阵中的路径 python
请设计一个函数,用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径。路径可以从矩阵中的任意一格开始,每一步可以在矩阵中向左、右、上、下移动一格。如果一条路径经过了矩阵的某一格,那么该路径不能再次进入该格子。例如,在下面的3×4的矩阵中包含一条字符串“bfce”的路径(路径中的字母用加粗标出)。
[[“a”,“b”,“c”,“e”],
[“s”,“f”,“c”,“s”],
[“a”,“d”,“e”,“e”]]
但矩阵中不包含字符串“abfb”的路径,因为字符串的第一个字符b占据了矩阵中的第一行第二个格子之后,路径不能再次进入这个格子。
输入:board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
输出:true
class Solution(object):
def exist(self, board, word):
"""
:type board: List[List[str]]
:type word: str
:rtype: bool
"""
if not board:
return False
rows = len(board)
cols = len(board[0])
visited = [[0]*cols for _ in range(rows)]
for row in range(rows):
for col in range (cols):
if self.dfs(row, col, rows, cols, board, word, visited):
return True
return False
def dfs(self, row, col, rows, cols, board, word, visited):
if not word:
return True
flag = False
if row>=0 and row<rows and col>=0 and col<cols \
and (visited[row][col] == 0) and word[0] == board[row][col]:
visited[row][col] =1
flag = self.dfs( row-1, col, rows, cols, board, word[1:], visited) \
or self.dfs( row+1, col, rows, cols, board, word[1:], visited) \
or self.dfs( row, col-1, rows, cols, board, word[1:], visited) \
or self.dfs( row, col+1, rows, cols, board, word[1:], visited)
if not flag:
visited[row][col] = 0
return flag