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