题目
地址:
https://leetcode.com/problems/edit-distance/description/
类别: Dynamic Programming
难度: Hard
描述:
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)
You have the following 3 operations permitted on a word:
a) Insert a character
b) Delete a character
c) Replace a character
分析
给定两个字符串x和y,可通过在x中删除,添加和替换字符操作将x转化为y,求出最少操作步数(即编辑距离)。
例:
x =“SNOWY”
y =“SUNNY”
最少操作方法之一:
S − N O W Y
S U N N − Y
minDistance = 3
解决
方法:动态规划
目标:求出两个字符串x [1···m]和y [1··n]之间的编辑距离。
定义子问题E(i,j): x的前缀x [1··i]和y [1··j]的前缀之间的编辑距离
最终目标:E(m,n)。
状态转移方程我们通过观察y[j]来讨论:
1. y[j] == x[i], 则E(i,j)转化为子问题E(i-1,j-1);
2. y[j] != x[i],有三种情况:
(1)y[j]由x [1···i]在末尾添加得到,子问题为E(i,j-1);
(2)y[j]由x [1···i]在删掉末尾元素x[i]后的x [1···i-1]转化得到,子问题为E(i-1,j);
(3)y[j]由x [1···i]末尾元素x[i]直接转换得到,子问题为E(i-1,j-1)。
状态迁移方程:
E(i, j) = min{1 + E(i − 1, j), 1 + E(i, j − 1), diff(i, j) + E(i − 1, j − 1)}
diff(i, j) = (x[i] != y[j])
伪代码:
for i = 0, 1, 2, . . . , m:
E(i, 0) = i
for j = 1, 2, . . . , n:
E(0, j) = j
for i = 1, 2, . . . , m:
for j = 1, 2, . . . , n:
E(i, j) = min{E(i − 1, j) + 1, E(i, j − 1) + 1, E(i − 1, j − 1) + diff(i, j)}
return E(m, n)
时间复杂度:O(mn)
空间复杂度:O(mn)
代码实现
class Solution {
public:
int minDistance(string word1, string word2) {
int m = word1.size(), n = word2.size();
int e1, e2, e3;
int e[m+1][n+1];
for(int i = 0; i < m+1; i++) {
e[i][0] = i;
}
for(int j = 0; j < n+1; j++) {
e[0][j] = j;
}
for(int i = 1; i < m+1; i++) {
for(int j = 1; j < n+1; j++) {
e1 = e[i-1][j] + 1;
e2 = e[i][j-1] + 1;
e3 = (word1[i-1] == word2[j-1]) ? e[i-1][j-1] : e[i-1][j-1] + 1;
e[i][j] = min(e1, min(e2,e3));
}
}
return e[m][n];
}
};
此外,还可进行空间优化,参见:
https://discuss.leetcode.com/topic/3136/my-o-mn-time-and-o-n-space-solution-using-dp-with-explanation