2015年8月30日
[LeetCode#128]Word Ladder II
摘要： Problem:Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, such that:Only one letter can be... 阅读全文
posted @ 2015-08-30 12:07 airforce 阅读(161) 评论(0) 推荐(0)
[LeetCode#127]Word Ladder
摘要： Problem:Given two words (beginWordandendWord), and a dictionary, find the length of shortest transformation sequence frombeginWordtoendWord, such that... 阅读全文
posted @ 2015-08-30 11:03 airforce 阅读(199) 评论(0) 推荐(0)