一道关于在二维字符矩阵中寻找给定单词的LeetCode问题，使用DFS策略进行搜索。题目要求单词只能沿水平、垂直方向相邻字符构成，并且不能重复使用同一字符。存在多个解法，但DFS是最常见的方法之一，通过遍历矩阵并在匹配过程中更新已访问位置避免重复搜索。如果找到单词则返回True，否则返回False。
Given an m x n grid of characters board and a string word, return true if word exists in the grid.
The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.
Example 1:
Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED" Output: true
Example 2:
Input:
最低0.47元/天 解锁文章
扫一扫
521
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
