79. Word Search (DFS)

79. Word Search

Medium

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.

 

Constraints:

• board and word consists only of lowercase and uppercase English letters.
• 1 <= board.length <= 200
• 1 <= board[i].length <= 200
• 1 <= word.length <= 10^3

 

笔记：

深搜中找到某一个符合情况的结果，程序就可以终止搜索的时候：

if dfs(x, y-1, index_word+1) or dfs(x-1, y, index_word+1) or dfs(x, y+1, index_word+1) or dfs(x+1, y, index_word+1):
    return True

在Python中，所有的不可变的变量，比如int，当对这个变量赋值时，其实不是修改了原有的变量，而是在内存中创建一个新的数据，然后将变量名字指到这个新的数据上，比如：

a = 10

a = 10 + 1 此时在内存中重新创建了一个新的变量，值为11，然后将a指向了11，而不是在存放10变量的位置进行了修改，将该位置的值修改成11.

 

class Solution:
    def exist(self, board: List[List[str]], word: str) -> bool:
        row_num = len(board)
        col_num = len(board[0])
        length = len(word)

        def dfs(x, y, index_word):
            if x < 0 or x >= row_num or y < 0 or y >= col_num:
                return False
            if board[x][y] != word[index_word]:
                return False
            if index_word == length - 1:
                return True
            board[x][y] = -1
            # if one of four return True, it means that we find the sequence
            if dfs(x, y-1, index_word+1) or dfs(x-1, y, index_word+1) or dfs(x, y+1, index_word+1) or dfs(x+1, y, index_word+1):
                return True
            board[x][y] = word[index_word]
            return False

        for i_r, val_r in enumerate(board):
            for i_c, val_c in enumerate(val_r):
                if dfs(i_r, i_c, 0):
                    return True
        return False