BFS
cgdong2014
这个作者很懒,什么都没留下…
展开
-
Word Ladder II
Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that: Only one letter can be changed at a timeEach intermediate word must exi原创 2014-12-30 09:46:11 · 305 阅读 · 0 评论 -
Word Ladder
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter can be changed at a timeEach intermediate word原创 2014-09-23 11:34:18 · 286 阅读 · 0 评论 -
Clone Graph
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as a separator for each原创 2015-03-14 07:02:32 · 294 阅读 · 0 评论