给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D','E','E']
]
给定 word = "ABCCED", 返回 true.
给定 word = "SEE", 返回 true.
给定 word = "ABCB", 返回 false.
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/word-search
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
dfs加回溯
func exist(board [][]byte, word string) bool {
height := len(board)
length := len(board[0])
bitmap := make([][]bool, height)
for i := 0; i < height; i++ {
bitmap[i] = make([]bool, length)
}
for i := 0; i < height; i++ {
for j := 0; j < length; j++ {
if find(board, word, i, j, bitmap) {
return true
}
}
}
return false
}
func find(board [][]byte, word string, x, y int, bitmap [][]bool) bool{
if board[x][y] != ([]byte(word))[0] {
return false
} else {
word := string(word[1:])
if len(word) == 0 {
return true
}
height := len(board)
length := len(board[0])
bitmap[x][y] = true
if (x > 0 && !bitmap[x-1][y] && find(board, word, x-1, y, bitmap)) ||
(x < height-1 && !bitmap[x+1][y] && find(board, word, x+1, y, bitmap)) ||
(y > 0 && !bitmap[x][y-1] && find(board, word, x, y-1, bitmap)) ||
(y < length-1 && !bitmap[x][y+1] && find(board, word, x, y+1, bitmap)) {
return true
} else {
bitmap[x][y] = false
return false
}
}
}