[LeetCode] 79. Word Search

题目内容

https://leetcode-cn.com/problems/word-search/

Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

Example:

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

Given word = "ABCCED", return true.
Given word = "SEE", return true.
Given word = "ABCB", return false.

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

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

---

题目思路

这道题目的核心在于搜索。我们遍历给出的单词板，寻找到和单词第一个字母相同的字母。然后以这个字母为中心进行上下左右的搜索。与此同时因为不能重复使用，所以建立另一个表格，在进行四周搜索之前把本单词对应的位置置换为1，搜索结束后归零。

---

程序代码

class Solution(object):
    def __init__(self):
        self.flag=False
    def exist(self, board, word):
        """
        :type board: List[List[str]]
        :type word: str
        :rtype: bool
        """
        m=len(board)
        n=len(board[0])
        length=len(word)
        
        if length>m*n:
            return False
        check_board=[[0]*n for i in range(m)]
        
        def search(i,j,curr):
            if board[i][j]!=word[curr]:
                return
            
            check_board[i][j]=1
            if curr==length-1:
                self.flag=True
                return
            if i<m-1 and not check_board[i+1][j] and not self.flag:
                search(i+1,j,curr+1)
            if i>0 and not check_board[i-1][j] and not self.flag:
                search(i-1,j,curr+1)
            if j<n-1 and not check_board[i][j+1] and not self.flag:
                search(i,j+1,curr+1)
            if j>0 and not check_board[i][j-1] and not self.flag:
                search(i,j-1,curr+1)
            
            check_board[i][j]=0
        
        
        for i in range(m):
            for j in range(n):
                if board[i][j]==word[0]:
                    search(i,j,0)
                    if self.flag:
                        break
        
        return self.flag