2013年9月17日
leetcode -- Word Ladder
摘要： Given two words (startandend), and a dictionary, find the length of shortest transformation sequence 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",&q 阅读全文
posted @ 2013-09-17 11:08 feiling 阅读(2434) 评论(1) 推荐(0)