摘要：
题目：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" 阅读全文
posted @ 2014-03-16 16:10
UsSam
阅读(135)
评论(0)
推荐(0)
浙公网安备 33010602011771号