题目
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.
You have the following 3 operations permitted on a word:
Insert a character
Delete a character
Replace a character
Example 1:
Input: word1 = “horse”, word2 = “ros”
Output: 3
Explanation:
horse -> rorse (replace ‘h’ with ‘r’)
rorse -> rose (remove ‘r’)
rose -> ros (remove ‘e’)
Example 2:
Input: word1 = “intention”, word2 = “execution”
Output: 5
Explanation:
intention -> inention (remove ‘t’)
inention -> enention (replace ‘i’ with ‘e’)
enention -> exention (replace ‘n’ with ‘x’)
exention -> exection (replace ‘n’ with ‘c’)
exection -> execution (insert ‘u’)
动态规划
动态规划四步走:dp定义-初始化-状态转移-结果.
dp定义:
dp[i][j]:表示word1[0:i]和word2[0:j]的最小编辑距离
初始化:
dp[0][…]:表示word1[0]和word2[…]的最小编辑距离,很显然word2的长度多少最小编辑距离就是多少。
dp[…][0]:表示word1[…]和word2[0]的最小编辑距离,很显然word1的长度多少最小编辑距离就是多少。
状态转移方程:
显然题目已经告诉了,三选一:插入、删除、修改
对应dp表达式:
dp[i-1][j]+1:word1[i-1]插入一个word2[j]的字符,就可以得到相同位置的相同字符。这是一步操作,所以距离长度要加1.
dp[i][j-1]+1:word1[i]删除一个word2[j-1]的字符,就可以得到相同位置的相同字符。
dp[i-1][j-1]+1:word1[i-1]替换为word2[j-1]的字符,就可以得到相同位置的相同字符。
结果就是dp[len(word1)][len(word2)].
python代码
class Solution(object):
def minDistance(self, word1, word2):
"""
:type word1: str
:type word2: str
:rtype: int
"""
dp = [[0 for j in range(len(word2)+1)] for i in range(len(word1)+1)]
for i in range(len(word1)+1):
dp[i][0] = i
for j in range(len(word2)+1):
dp[0][j] = j
for i in range(1,len(word1)+1):
for j in range(1,len(word2)+1):
if word1[i-1]==word2[j-1]:
dp[i][j] = dp[i-1][j-1]
else:
dp[i][j] = min(dp[i-1][j]+1,dp[i][j-1]+1,dp[i-1][j-1]+1)
return dp[len(word1)][len(word2)]