第一题叫LevenshteinDistance 或者 Edit Distance ，经典动规题代码通俗易懂~~~:procedure levenshtein; var
st1,st2:string;
d:array[0..1000000] of integer;//d[i , j]用于记录str1[1...i]与str2[1..j]的Levenshtein距离
i,j,m,n,cost:integer; begin
m:=length(st1);
n:=length(st2);
for i:=0 to m do d[i,0]:=i; //初始化
for j:= 0...
|
