2014年5月4日
Leetcode | Edit Distance
摘要： Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have t... 阅读全文
posted @ 2014-05-04 23:21 linyx 阅读(134) 评论(0) 推荐(0) 编辑
Leetcode | Word Ladder
摘要： Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter ca... 阅读全文
posted @ 2014-05-04 13:54 linyx 阅读(602) 评论(0) 推荐(0) 编辑