转移方程如下
i
f
i
=
0
,
d
p
[
0
]
[
j
]
=
j
i
f
j
=
0
,
d
p
[
i
]
[
0
]
=
i
i
f
i
>
0
a
n
d
j
>
0
a
n
d
s
t
r
1
[
i
]
=
=
s
t
r
2
[
j
]
,
d
p
[
i
]
[
j
]
=
m
i
n
(
d
p
[
i
−
1
]
[
j
−
1
]
,
d
p
[
i
−
1
]
[
j
]
+
1
,
d
p
[
i
]
[
j
−
1
]
+
1
)
if i = 0, dp[0][j] = j \\ if j = 0, dp[i][0] = i \\ if i>0\ and\ j>0\ and\ str1[i] == str2[j],\\ \ dp[i][j] = min(dp[i-1][j-1], dp[i-1][j] + 1, dp[i][j-1] + 1)
ifi=0,dp[0][j]=jifj=0,dp[i][0]=iifi>0andj>0andstr1[i]==str2[j],dp[i][j]=min(dp[i−1][j−1],dp[i−1][j]+1,dp[i][j−1]+1)