2015年5月27日
Java for LeetCode 127 Word Ladder
摘要： Given two words (beginWord and endWord), and a dictionary, find the length of shortest transformation sequence from beginWord to endWord, such that:On... 阅读全文
posted @ 2015-05-27 11:00 TonyLuis 阅读(672) 评论(0) 推荐(0)
Java for LeetCode 126 Word Ladder II 【HARD】
摘要： Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that: Only one letter can be c... 阅读全文
posted @ 2015-05-27 10:52 TonyLuis 阅读(369) 评论(0) 推荐(0)