word_ladder
word_ladder.go 源码
package leetcode
//单词接龙
//广度优先
func ladderLength(beginWord string, endWord string, wordList []string) int {
wordSet, charSet := map[string]bool{}, map[int32]bool{}
for _, v := range wordList {
wordSet[v] = true
for _, b := range v {
charSet[b] = true
}
}
if !wordSet[endWord] {
return 0
}
queue, res := []string{beginWord}, 0
for len(queue) > 0 {
n := len(queue)
for i := 0; i < n; i++ {
cur := queue[0]
queue = queue[1:]
if cur == endWord {
return res + 1
}
for j := 0; j < len(cur); j++ {
for c, _ := range charSet {
modStr := cur[:j] + string(c) + cur[j+1:]
if wordSet[modStr] {
queue = append(queue, modStr)
delete(wordSet, modStr)
}
}
}
}
res++
}
return 0
}
你可能感兴趣的文章
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
6、 golang
-
7、 openharmony