23 lines
558 B
Python
23 lines
558 B
Python
|
def min_edit_distance(A, B):
|
||
|
|
m, n = len(A), len(B)
|
||
|
|
dp = [[0] * (n + 1) for _ in range(m + 1)]
|
||
|
|
|
||
|
|
for i in range(m + 1):
|
||
|
|
dp[i][0] = i
|
||
|
|
for j in range(n + 1):
|
||
|
|
dp[0][j] = j
|
||
|
|
|
||
|
|
for i in range(1, m + 1):
|
||
|
|
for j in range(1, n + 1):
|
||
|
|
if A[i - 1] == B[j - 1]:
|
||
|
|
dp[i][j] = dp[i - 1][j - 1]
|
||
|
|
else:
|
||
|
|
dp[i][j] = 1 + min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1])
|
||
|
|
|
||
|
|
return dp[m][n]
|
||
|
|
|
||
|
|
|
||
|
|
# 测试
|
||
|
|
X = "ABCBDAB"
|
||
|
|
Y = "BDCAB"
|
||
|
|
print("Minimum Edit Distance:", min_edit_distance(X, Y))
|