笔记1——动态规划DP

剪钢材问题

代码实现

增加存储减少重复计算

Algorithm of Edit Distance

For two strings

X of length n

Y of length m 

We define D(i, j)

the edit distance between X[1…i] and Y[1..j]

The edit distance between X and Y is thus D(n, m)

Initialization 

D(i, 0) = i

D(0, j) = j