Word Search Problem - Non-recursive Solution

最新推荐文章于 2024-10-21 16:14:22 发布

bonny95

最新推荐文章于 2024-10-21 16:14:22 发布

阅读量1.8k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/bonny95/article/details/39274001

本文探讨了在一个二维字符网格中查找给定单词的问题。通过避免使用递归方法，采用三个栈来记录可能的坐标、单词字符位置及已访问单元格，提供了一种新颖的解决方案。

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

The Word Search states:

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.

For example,

Given board =

[

[“ABCE”],

[“SFCS”],

[“ADEE”]

]

word = “ABCCED”, -> returns true,
word = “SEE”, -> returns true,
word = “ABCB”, -> returns false.

The most popular solution to this problem is recursive, such as http://yucoding.blogspot.com/2013/02/leetcode-question-124-word-search.html.

However, I tried to solve this problem without recursion. In my implementation, three stacks are used to record the possible coordinates in board, the character position in word(with respect to each candidate cell) and the cells have been accessed to each possible coordinates, repectively.

- See more at: http://bo-yang.github.io/2014/07/28/word-search/#sthash.eJW7ZuLR.dpuf

http://bo-yang.github.io/2014/07/28/word-search