2014年8月23日

compute Binomial Coefficient or combinations with dynamic programming

摘要： The ProblemWrite a function that takes two parameters n and k and returns the value of Binomial Coefficient C(n, k).For example, your function should ... 阅读全文

posted @ 2014-08-23 12:17 AIDasr 阅读(337) 评论(0) 推荐(0)

Edit Distance (or Levenshtein Distance) python solution for leetcode EPI 17.2

摘要： https://oj.leetcode.com/problems/edit-distance/Edit DistanceGiven two wordsword1andword2, find the minimum number of steps required to convertword1tow... 阅读全文

posted @ 2014-08-23 09:34 AIDasr 阅读(1057) 评论(1) 推荐(0)

导航