2014年1月12日
Leetcode: Word Ladder II
摘要： QuestionGiven two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, such that:Only one letter can be changed at a timeEach intermediate word must exist in the dictionaryFor example,Given:start="hit"end="cog"dict=["hot",& 阅读全文
posted @ 2014-01-12 09:52 SangS 阅读(659) 评论(0) 推荐(0)