79. Word Search

79. Word Search

這一題用的是回溯算法，接著從矩陣的每個字元開始出發，首先會先判斷兩件事情：

1. 是否超過邊界？
2. 該座標的是不是目標字串的第一個字？

如果是的話才會開始向下搜尋，向下搜尋的時候要注意兩件事情

1. 要記得將目前的座標標記成為已造訪
2. 向下傳遞時，是傳遞目標字串的 word[1:]

終止條件是字串搜尋完畢

class Solution:
    def exist(self, board: List[List[str]], word: str) -> bool:
        rows = len(board)
        cols = len(board[0])
        directions = [(1,0),(-1,0),(0,1),(0,-1)]
        def backtrack(r, c, word):
            if len(word) == 0:
                return True
            if 0 <= r < rows and 0 <= c < cols and board[r][c] == word[0]:
                board[r][c] = '#'
                for dr, dc in directions:
                    if backtrack(r+dr, c+dc, word[1:]):
                        return True
                board[r][c] = word[0]
            return False

        for r in range(rows):
            for c in range(cols):
                if backtrack(r, c, word):
                    return True
        return False

這是從另外一個方向出發：

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

        directions = [(1, 0), (0, 1), (-1, 0), (0, -1)]

        def backtrack(row, col, i):
            if board[row][col] != word[i]:
                return False
            if i == len(word) - 1:
                return True

            board[row][col] = '#'
            for dr, dc in directions:
                nr = row + dr
                nc = col + dc
                if 0 <= nr < rows and 0 <= nc < cols and board[nr][nc] != '#':
                    if backtrack(nr, nc, i + 1):
                        return True
            board[row][col] = word[i]
            
            return False


            

        for row in range(rows):
            for col in range(cols):
                if board[row][col] == word[0]:
                    if backtrack(row, col, 0):
                        return True
    
        return False