72. Edit Distance
# Hard (非常经典,一定要会)
Solution:
Initilize
minDis[i][j]
, 这种一定是初始化横行和纵行。minDis[i][j]
means the minimum distance of converting fromword1[:i+1]
toword2[:j+1]
. One extra empty element inminDis
is very necessary, because following elements are based on the previous elemens.Three cases may affect minDis.
minDis[i-1][j]
+ 1 次转换minDis[i][j-1]
+ 1 次转换word1[i-1] = word2[j-1]
, 所以不用转换,minDis[i-1][j-1]
从中找一个最小值赋值给
minDis[i][j]
即可。
Last updated
Was this helpful?