2013年6月13日
Word Ladder II
摘要： Given 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","dot 阅读全文
posted @ 2013-06-13 15:24 一只会思考的猪 阅读(181) 评论(0) 推荐(0)