Commita90b71d

night

committed

add time complexity

1 parent268ac01 commita90b71dCopy full SHA for a90b71d

File tree

-0

lines changed

-0

lines changed

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,6 +6,11 @@ import kotlin.collections.HashMap`
`6`	`6`	`importkotlin.collections.HashSet`
`7`	`7`	`importkotlin.math.max`
`8`	`8`
	`9`	`+/**`
	`10`	`+ * 假设 beginword 和 endword 之间的距离是 d。每个节点可以扩展出 k 个节点。`
	`11`	`+ * 那么正常的时间复杂就是 k^d`
	`12`	`+ * 双向搜索的时间复杂度就是 k^(d/2) + k^(d/2)`
	`13`	`+*/`
`9`	`14`	`classSolution {`
`10`	`15`	`funfindLadders(`
`11`	`16`	`beginWord:String,`

Comments

(0)