2015年4月6日
Word Ladder——LeetCode
摘要： Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can be ... 阅读全文
posted @ 2015-04-06 19:49 丶Blank 阅读(224) 评论(0) 推荐(0)
Letter Combinations of a Phone Number——LeetCode
摘要： Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon... 阅读全文
posted @ 2015-04-06 15:02 丶Blank 阅读(133) 评论(0) 推荐(0)