Leetcode 79. Word Search--给定一个字符串，在二维数组中遍历每一个字符，要求连续遍历相邻的元素，每个元素只能遍历一次

最新推荐文章于 2023-02-10 01:15:11 发布

二十六画生的博客

最新推荐文章于 2023-02-10 01:15:11 发布

阅读量461

点赞数

CC 4.0 BY-SA版权

分类专栏：笔试面经 LeetCode 剑指Offer 后端/大数据文章标签： Leetcode 79 Word Search

本文链接：https://blog.youkuaiyun.com/u010002184/article/details/85207429

笔试面经 LeetCode 剑指Offer 后端/大数据专栏收录该内容

226 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

这篇博客详细介绍了LeetCode 79题——Word Search的解题思路，通过逐个检查网格中相邻的字符，判断是否能按顺序形成目标单词，并在过程中避免重复访问同一元素。文章通过示例展示了搜索过程，最终找到正确路径并返回true。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

import java.util.ArrayList;
import java.util.List;

//Runtime: 109 ms, faster than 8.81% of Java online submissions for Word Search.

public class Solution_79_WordSearch_Recursion1 {
    public static vo

了解本专栏