2014年12月23日
【leetcode】Edit Distance (hard)
摘要： Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol... 阅读全文
posted @ 2014-12-23 16:41 匡子语 阅读(224) 评论(0) 推荐(0)
【leetcode】 Interleaving String (hard)
摘要： Givens1,s2,s3, find whethers3is formed by the interleaving ofs1ands2.For example,Given:s1="aabcc",s2="dbbca",Whens3="aadbbcbcac", return true.Whens3="... 阅读全文
posted @ 2014-12-23 15:57 匡子语 阅读(204) 评论(0) 推荐(0)