Leetcode-79. Word Search 单词搜索

最新推荐文章于 2022-07-22 12:49:05 发布

简米

最新推荐文章于 2022-07-22 12:49:05 发布

阅读量171

点赞数

分类专栏： Leetcode 文章标签： leetcode dfs python

本文链接：https://blog.csdn.net/JamieLuo/article/details/106417459

版权

Leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

题目

给定一个二维网格和一个单词，找出该单词是否存在于网格中。
单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
链接：https://leetcode.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.

思路及代码

DFS

class Solution:
    def exist(self, board: List[List[str]], word: str) -> bool:
        def dfs(pos, length, row, col, m, n):
            if pos == length:
                return True
            if row < 0 or row > m-1 or col < 0 or col > n-1:
                return
            if board[row][col] != word[pos] or visited[row][col]:
                return
            if board[row][col] == word[pos]:
                visited[row][col] = 1
                find = dfs(pos+1, length, row+1, col, m, n) or\
                dfs(pos+1, length, row-1, col, m, n) or\
                dfs(pos+1, length, row, col+1, m, n) or\
                dfs(pos+1, length, row, col-1, m, n)
                if find:
                    return True
            visited[row][col] = 0
            return
            
        
        if not board:
            return False
        m = len(board)
        n = len(board[0])
        visited = [[0 for i in range(n)] for j in range(m)]
        for i in range(m):
            for j in range(n):
                if dfs(0, len(word), i, j, m, n):
                    return True
        return False