2014年11月24日

LeetCode: Word Ladder II 解题报告
摘要： Word Ladder II Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:Only one l... 阅读全文
posted @ 2014-11-24 19:55 Yu's Garden 阅读(1669) 评论(0) 推荐(0) 编辑
LeetCode: Count and Say 解题报告
摘要： Count and SayThe count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11... 阅读全文
posted @ 2014-11-24 10:41 Yu's Garden 阅读(726) 评论(0) 推荐(0) 编辑

导航