单词搜索

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

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

 

示例:

board =
[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

给定 word = "ABCCED", 返回 true
给定 word = "SEE", 返回 true
给定 word = "ABCB", 返回 false

class Solution:
    directions=[[-1,0],[0,1],[1,0],[0,-1]]
    #directions = [(0, -1), (-1, 0), (0, 1), (1, 0)]
    def exist(self, board: List[List[str]], word: str) -> bool:
        m=len(board)
        if m==0:
            return False
        n=len(board[0])
        flag=[[0]*n for _ in range(m)]
        for i in range(m):
            for j in range(n):
                if self.search(board,word,0,i,j,flag,m,n):
                    return True
        return False
    def search(self,board,word,index,start_x,start_y,flag,m,n):
        if index==len(word)-1:
            return board[start_x][start_y]==word[index]
        if board[start_x][start_y]==word[index]:
            flag[start_x][start_y]=1
            for direction in self.directions:
                x_new=start_x+direction[0]
                y_new=start_y+direction[1]
                if 0 <= x_new < m and 0 <= y_new < n and\
                 not flag[x_new][y_new] and self.search(board,word,index+1,x_new,y_new,flag,m,n):
                    return True
            flag[start_x][start_y]=0
        return False