剪鋼材問題
代碼實(shí)現(xiàn)
增加存儲(chǔ)減少重復(fù)計(jì)算
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